./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:51,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:51,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:51,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:51,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:51,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:51,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:51,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:51,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:51,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:51,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:51,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:51,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:51,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:51,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:51,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:51,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:51,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:51,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:51,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:51,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:51,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:51,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:51,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:51,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:51,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:51,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:51,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:51,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:51,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:51,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:51,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:51,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:51,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:51,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:51,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:51,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:51,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:51,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:51,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:51,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:51,234 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:06:51,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:51,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:51,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:51,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:51,253 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:51,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:51,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:06:51,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:51,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:06:51,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:51,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:06:51,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:51,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:06:51,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:06:51,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:51,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:51,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:06:51,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:51,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:51,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:51,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:51,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:51,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:51,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:51,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:06:51,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:51,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:06:51,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:06:51,260 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_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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 -> 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 [2019-11-16 00:06:51,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:51,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:51,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:51,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:51,318 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:51,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2019-11-16 00:06:51,382 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/data/8dbc9f7da/2b1097df242f4999a02a305c882ac81a/FLAGa60581ece [2019-11-16 00:06:52,010 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:52,011 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2019-11-16 00:06:52,042 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/data/8dbc9f7da/2b1097df242f4999a02a305c882ac81a/FLAGa60581ece [2019-11-16 00:06:52,113 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/data/8dbc9f7da/2b1097df242f4999a02a305c882ac81a [2019-11-16 00:06:52,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:52,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:52,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:52,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:52,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:52,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:52" (1/1) ... [2019-11-16 00:06:52,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d42c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:52, skipping insertion in model container [2019-11-16 00:06:52,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:52" (1/1) ... [2019-11-16 00:06:52,138 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:52,223 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:53,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:53,158 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:53,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:53,547 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:53,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53 WrapperNode [2019-11-16 00:06:53,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:53,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:53,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:53,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:53,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:53,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:53,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:53,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:53,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:53,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:54,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... [2019-11-16 00:06:54,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:54,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:54,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:54,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:54,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:06:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:54,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:58,872 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:58,873 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:06:58,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:58 BoogieIcfgContainer [2019-11-16 00:06:58,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:58,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:06:58,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:06:58,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:06:58,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:52" (1/3) ... [2019-11-16 00:06:58,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d7aff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:58, skipping insertion in model container [2019-11-16 00:06:58,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:53" (2/3) ... [2019-11-16 00:06:58,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d7aff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:58, skipping insertion in model container [2019-11-16 00:06:58,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:58" (3/3) ... [2019-11-16 00:06:58,887 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label36.c [2019-11-16 00:06:58,898 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:06:58,908 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:06:58,921 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:06:58,968 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:06:58,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:06:58,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:06:58,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:58,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:58,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:06:58,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:58,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:06:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-16 00:06:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:06:59,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:59,019 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:59,021 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2019-11-16 00:06:59,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:59,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444191530] [2019-11-16 00:06:59,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:59,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:59,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:59,449 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-16 00:06:59,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444191530] [2019-11-16 00:06:59,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:59,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:59,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095589810] [2019-11-16 00:06:59,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:59,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:59,475 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-16 00:07:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:05,495 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-11-16 00:07:05,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:05,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-16 00:07:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:05,526 INFO L225 Difference]: With dead ends: 1466 [2019-11-16 00:07:05,527 INFO L226 Difference]: Without dead ends: 974 [2019-11-16 00:07:05,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-16 00:07:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-11-16 00:07:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-16 00:07:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-11-16 00:07:05,657 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 61 [2019-11-16 00:07:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:05,662 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-11-16 00:07:05,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-11-16 00:07:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-16 00:07:05,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:05,670 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:05,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash 13242671, now seen corresponding path program 1 times [2019-11-16 00:07:05,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:05,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894181296] [2019-11-16 00:07:05,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:05,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:05,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:05,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894181296] [2019-11-16 00:07:05,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:05,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:05,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887564285] [2019-11-16 00:07:05,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:05,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:05,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:05,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:05,939 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-11-16 00:07:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:11,259 INFO L93 Difference]: Finished difference Result 3747 states and 5437 transitions. [2019-11-16 00:07:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:11,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-11-16 00:07:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:11,279 INFO L225 Difference]: With dead ends: 3747 [2019-11-16 00:07:11,280 INFO L226 Difference]: Without dead ends: 2777 [2019-11-16 00:07:11,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 00:07:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-11-16 00:07:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2019-11-16 00:07:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-11-16 00:07:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3624 transitions. [2019-11-16 00:07:11,361 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3624 transitions. Word has length 126 [2019-11-16 00:07:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:11,362 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3624 transitions. [2019-11-16 00:07:11,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3624 transitions. [2019-11-16 00:07:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-16 00:07:11,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:11,374 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:11,374 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1978174500, now seen corresponding path program 1 times [2019-11-16 00:07:11,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:11,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650202992] [2019-11-16 00:07:11,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:11,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:11,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:07:11,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650202992] [2019-11-16 00:07:11,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910607353] [2019-11-16 00:07:11,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:07:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:11,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:11,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:11,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:11,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-16 00:07:11,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254916220] [2019-11-16 00:07:11,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:11,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:11,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:11,970 INFO L87 Difference]: Start difference. First operand 2775 states and 3624 transitions. Second operand 3 states. [2019-11-16 00:07:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:15,436 INFO L93 Difference]: Finished difference Result 7941 states and 10408 transitions. [2019-11-16 00:07:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:15,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-16 00:07:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:15,472 INFO L225 Difference]: With dead ends: 7941 [2019-11-16 00:07:15,472 INFO L226 Difference]: Without dead ends: 5168 [2019-11-16 00:07:15,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 231 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-16 00:07:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-11-16 00:07:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-11-16 00:07:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-11-16 00:07:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3976 transitions. [2019-11-16 00:07:15,574 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3976 transitions. Word has length 231 [2019-11-16 00:07:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:15,575 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 3976 transitions. [2019-11-16 00:07:15,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3976 transitions. [2019-11-16 00:07:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-11-16 00:07:15,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:15,586 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:07:15,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:15,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 482134373, now seen corresponding path program 1 times [2019-11-16 00:07:15,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:15,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56362306] [2019-11-16 00:07:15,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:15,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:15,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-16 00:07:16,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56362306] [2019-11-16 00:07:16,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:16,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:16,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917131715] [2019-11-16 00:07:16,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:16,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:16,833 INFO L87 Difference]: Start difference. First operand 3073 states and 3976 transitions. Second operand 5 states. [2019-11-16 00:07:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:20,754 INFO L93 Difference]: Finished difference Result 7342 states and 9252 transitions. [2019-11-16 00:07:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:20,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 411 [2019-11-16 00:07:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:20,784 INFO L225 Difference]: With dead ends: 7342 [2019-11-16 00:07:20,784 INFO L226 Difference]: Without dead ends: 4271 [2019-11-16 00:07:20,789 INFO L600 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-16 00:07:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-11-16 00:07:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-11-16 00:07:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-16 00:07:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4928 transitions. [2019-11-16 00:07:21,019 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4928 transitions. Word has length 411 [2019-11-16 00:07:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:21,021 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4928 transitions. [2019-11-16 00:07:21,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4928 transitions. [2019-11-16 00:07:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-11-16 00:07:21,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:21,038 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:07:21,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:21,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1884331539, now seen corresponding path program 1 times [2019-11-16 00:07:21,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:21,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544071180] [2019-11-16 00:07:21,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:07:21,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544071180] [2019-11-16 00:07:21,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:21,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:21,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142754667] [2019-11-16 00:07:21,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:21,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:21,598 INFO L87 Difference]: Start difference. First operand 3971 states and 4928 transitions. Second operand 4 states. [2019-11-16 00:07:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:26,036 INFO L93 Difference]: Finished difference Result 9742 states and 12308 transitions. [2019-11-16 00:07:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:26,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-11-16 00:07:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:26,070 INFO L225 Difference]: With dead ends: 9742 [2019-11-16 00:07:26,070 INFO L226 Difference]: Without dead ends: 5773 [2019-11-16 00:07:26,076 INFO L600 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-16 00:07:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-11-16 00:07:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5470. [2019-11-16 00:07:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-11-16 00:07:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6685 transitions. [2019-11-16 00:07:26,194 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6685 transitions. Word has length 485 [2019-11-16 00:07:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:26,195 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 6685 transitions. [2019-11-16 00:07:26,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6685 transitions. [2019-11-16 00:07:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-11-16 00:07:26,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:26,212 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:26,212 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1615305343, now seen corresponding path program 1 times [2019-11-16 00:07:26,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:26,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652855146] [2019-11-16 00:07:26,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:26,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:26,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-16 00:07:26,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652855146] [2019-11-16 00:07:26,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:26,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:26,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840536574] [2019-11-16 00:07:26,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:26,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:26,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:26,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:26,724 INFO L87 Difference]: Start difference. First operand 5470 states and 6685 transitions. Second operand 4 states. [2019-11-16 00:07:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:30,016 INFO L93 Difference]: Finished difference Result 10937 states and 13389 transitions. [2019-11-16 00:07:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:30,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2019-11-16 00:07:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:30,047 INFO L225 Difference]: With dead ends: 10937 [2019-11-16 00:07:30,047 INFO L226 Difference]: Without dead ends: 5469 [2019-11-16 00:07:30,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 00:07:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-11-16 00:07:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-11-16 00:07:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-16 00:07:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6352 transitions. [2019-11-16 00:07:30,161 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6352 transitions. Word has length 491 [2019-11-16 00:07:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:30,162 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6352 transitions. [2019-11-16 00:07:30,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6352 transitions. [2019-11-16 00:07:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-11-16 00:07:30,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:30,179 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:07:30,179 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -739237505, now seen corresponding path program 1 times [2019-11-16 00:07:30,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:30,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134709940] [2019-11-16 00:07:30,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:30,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 534 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-16 00:07:31,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134709940] [2019-11-16 00:07:31,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002449489] [2019-11-16 00:07:31,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:07:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:31,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:31,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-16 00:07:31,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:31,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:07:31,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645158388] [2019-11-16 00:07:31,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:31,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:31,900 INFO L87 Difference]: Start difference. First operand 5466 states and 6352 transitions. Second operand 3 states. [2019-11-16 00:07:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:33,961 INFO L93 Difference]: Finished difference Result 10930 states and 12702 transitions. [2019-11-16 00:07:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:33,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-11-16 00:07:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:33,989 INFO L225 Difference]: With dead ends: 10930 [2019-11-16 00:07:33,989 INFO L226 Difference]: Without dead ends: 5466 [2019-11-16 00:07:34,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 513 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-16 00:07:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-11-16 00:07:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5466. [2019-11-16 00:07:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-16 00:07:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6334 transitions. [2019-11-16 00:07:34,112 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6334 transitions. Word has length 514 [2019-11-16 00:07:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:34,113 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6334 transitions. [2019-11-16 00:07:34,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6334 transitions. [2019-11-16 00:07:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-16 00:07:34,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:34,122 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2019-11-16 00:07:34,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:34,329 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1317201490, now seen corresponding path program 1 times [2019-11-16 00:07:34,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:34,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847790644] [2019-11-16 00:07:34,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:34,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:07:34,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847790644] [2019-11-16 00:07:34,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:34,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:34,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104180345] [2019-11-16 00:07:34,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:34,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:34,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:34,917 INFO L87 Difference]: Start difference. First operand 5466 states and 6334 transitions. Second operand 4 states. [2019-11-16 00:07:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:39,168 INFO L93 Difference]: Finished difference Result 10932 states and 12672 transitions. [2019-11-16 00:07:39,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:39,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 517 [2019-11-16 00:07:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:39,189 INFO L225 Difference]: With dead ends: 10932 [2019-11-16 00:07:39,190 INFO L226 Difference]: Without dead ends: 5468 [2019-11-16 00:07:39,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-11-16 00:07:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5463. [2019-11-16 00:07:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-11-16 00:07:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6173 transitions. [2019-11-16 00:07:39,270 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6173 transitions. Word has length 517 [2019-11-16 00:07:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:39,271 INFO L462 AbstractCegarLoop]: Abstraction has 5463 states and 6173 transitions. [2019-11-16 00:07:39,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6173 transitions. [2019-11-16 00:07:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-11-16 00:07:39,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:39,281 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:39,281 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1882152332, now seen corresponding path program 1 times [2019-11-16 00:07:39,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:39,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824758588] [2019-11-16 00:07:39,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:39,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 571 proven. 3 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-16 00:07:40,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824758588] [2019-11-16 00:07:40,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165902914] [2019-11-16 00:07:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:07:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:41,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:41,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-16 00:07:41,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:41,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:07:41,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801819003] [2019-11-16 00:07:41,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:41,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:41,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:41,308 INFO L87 Difference]: Start difference. First operand 5463 states and 6173 transitions. Second operand 3 states. [2019-11-16 00:07:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:43,734 INFO L93 Difference]: Finished difference Result 14523 states and 16465 transitions. [2019-11-16 00:07:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:43,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 549 [2019-11-16 00:07:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:43,759 INFO L225 Difference]: With dead ends: 14523 [2019-11-16 00:07:43,759 INFO L226 Difference]: Without dead ends: 9062 [2019-11-16 00:07:43,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 548 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-16 00:07:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2019-11-16 00:07:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 8755. [2019-11-16 00:07:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-11-16 00:07:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 9759 transitions. [2019-11-16 00:07:43,898 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 9759 transitions. Word has length 549 [2019-11-16 00:07:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:43,902 INFO L462 AbstractCegarLoop]: Abstraction has 8755 states and 9759 transitions. [2019-11-16 00:07:43,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 9759 transitions. [2019-11-16 00:07:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-16 00:07:43,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:43,915 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-16 00:07:44,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:44,121 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:44,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2096021639, now seen corresponding path program 1 times [2019-11-16 00:07:44,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:44,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108772939] [2019-11-16 00:07:44,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:44,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:44,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-11-16 00:07:44,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108772939] [2019-11-16 00:07:44,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:44,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:44,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391050351] [2019-11-16 00:07:44,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:44,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:44,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:44,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:44,780 INFO L87 Difference]: Start difference. First operand 8755 states and 9759 transitions. Second operand 3 states. [2019-11-16 00:07:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:46,964 INFO L93 Difference]: Finished difference Result 17805 states and 19855 transitions. [2019-11-16 00:07:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:46,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-11-16 00:07:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:46,983 INFO L225 Difference]: With dead ends: 17805 [2019-11-16 00:07:46,984 INFO L226 Difference]: Without dead ends: 9052 [2019-11-16 00:07:46,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9052 states. [2019-11-16 00:07:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9052 to 8753. [2019-11-16 00:07:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8753 states. [2019-11-16 00:07:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 9755 transitions. [2019-11-16 00:07:47,106 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 9755 transitions. Word has length 562 [2019-11-16 00:07:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:47,108 INFO L462 AbstractCegarLoop]: Abstraction has 8753 states and 9755 transitions. [2019-11-16 00:07:47,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 9755 transitions. [2019-11-16 00:07:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-11-16 00:07:47,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:47,122 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:47,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1471252033, now seen corresponding path program 1 times [2019-11-16 00:07:47,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:47,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006201416] [2019-11-16 00:07:47,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:47,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:47,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 647 proven. 3 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-16 00:07:48,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006201416] [2019-11-16 00:07:48,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059205075] [2019-11-16 00:07:48,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:07:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:48,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:07:48,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:48,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:07:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-16 00:07:49,427 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:49,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-16 00:07:49,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992213098] [2019-11-16 00:07:49,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:07:49,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:07:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:07:49,429 INFO L87 Difference]: Start difference. First operand 8753 states and 9755 transitions. Second operand 9 states. [2019-11-16 00:07:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:57,261 INFO L93 Difference]: Finished difference Result 23340 states and 25838 transitions. [2019-11-16 00:07:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:07:57,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 625 [2019-11-16 00:07:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:57,279 INFO L225 Difference]: With dead ends: 23340 [2019-11-16 00:07:57,279 INFO L226 Difference]: Without dead ends: 9948 [2019-11-16 00:07:57,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 622 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:07:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9948 states. [2019-11-16 00:07:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9948 to 9648. [2019-11-16 00:07:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9648 states. [2019-11-16 00:07:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9648 states to 9648 states and 10076 transitions. [2019-11-16 00:07:57,411 INFO L78 Accepts]: Start accepts. Automaton has 9648 states and 10076 transitions. Word has length 625 [2019-11-16 00:07:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:57,412 INFO L462 AbstractCegarLoop]: Abstraction has 9648 states and 10076 transitions. [2019-11-16 00:07:57,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:07:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9648 states and 10076 transitions. [2019-11-16 00:07:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-16 00:07:57,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:57,424 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:07:57,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:57,635 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2145955924, now seen corresponding path program 1 times [2019-11-16 00:07:57,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:57,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734007578] [2019-11-16 00:07:57,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:57,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:57,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-11-16 00:07:58,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734007578] [2019-11-16 00:07:58,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:58,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:58,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851245742] [2019-11-16 00:07:58,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:58,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:58,210 INFO L87 Difference]: Start difference. First operand 9648 states and 10076 transitions. Second operand 3 states. [2019-11-16 00:07:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,535 INFO L93 Difference]: Finished difference Result 22283 states and 23308 transitions. [2019-11-16 00:07:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:59,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-11-16 00:07:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,559 INFO L225 Difference]: With dead ends: 22283 [2019-11-16 00:07:59,559 INFO L226 Difference]: Without dead ends: 12338 [2019-11-16 00:07:59,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12338 states. [2019-11-16 00:07:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12338 to 12039. [2019-11-16 00:07:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12039 states. [2019-11-16 00:07:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12039 states to 12039 states and 12495 transitions. [2019-11-16 00:07:59,737 INFO L78 Accepts]: Start accepts. Automaton has 12039 states and 12495 transitions. Word has length 662 [2019-11-16 00:07:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,740 INFO L462 AbstractCegarLoop]: Abstraction has 12039 states and 12495 transitions. [2019-11-16 00:07:59,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 12039 states and 12495 transitions. [2019-11-16 00:07:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2019-11-16 00:07:59,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,752 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:07:59,753 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1492551500, now seen corresponding path program 1 times [2019-11-16 00:07:59,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759942752] [2019-11-16 00:07:59,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:08:00,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759942752] [2019-11-16 00:08:00,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:00,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:00,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640652568] [2019-11-16 00:08:00,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:00,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:00,555 INFO L87 Difference]: Start difference. First operand 12039 states and 12495 transitions. Second operand 4 states. [2019-11-16 00:08:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:02,135 INFO L93 Difference]: Finished difference Result 23145 states and 24053 transitions. [2019-11-16 00:08:02,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:02,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 686 [2019-11-16 00:08:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:02,145 INFO L225 Difference]: With dead ends: 23145 [2019-11-16 00:08:02,145 INFO L226 Difference]: Without dead ends: 11108 [2019-11-16 00:08:02,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2019-11-16 00:08:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 9008. [2019-11-16 00:08:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-16 00:08:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 9271 transitions. [2019-11-16 00:08:02,277 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 9271 transitions. Word has length 686 [2019-11-16 00:08:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:02,278 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 9271 transitions. [2019-11-16 00:08:02,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 9271 transitions. [2019-11-16 00:08:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-16 00:08:02,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:02,290 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:08:02,290 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 940636783, now seen corresponding path program 1 times [2019-11-16 00:08:02,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:02,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251625453] [2019-11-16 00:08:02,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-16 00:08:02,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251625453] [2019-11-16 00:08:02,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:02,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:02,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353473525] [2019-11-16 00:08:02,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:02,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:02,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:02,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:02,891 INFO L87 Difference]: Start difference. First operand 9008 states and 9271 transitions. Second operand 3 states. [2019-11-16 00:08:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:03,843 INFO L93 Difference]: Finished difference Result 18014 states and 18546 transitions. [2019-11-16 00:08:03,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:03,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2019-11-16 00:08:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:03,851 INFO L225 Difference]: With dead ends: 18014 [2019-11-16 00:08:03,851 INFO L226 Difference]: Without dead ends: 9307 [2019-11-16 00:08:03,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2019-11-16 00:08:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 9008. [2019-11-16 00:08:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-16 00:08:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 9268 transitions. [2019-11-16 00:08:03,933 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 9268 transitions. Word has length 691 [2019-11-16 00:08:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:03,934 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 9268 transitions. [2019-11-16 00:08:03,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 9268 transitions. [2019-11-16 00:08:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2019-11-16 00:08:03,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:03,952 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:03,953 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1105372660, now seen corresponding path program 1 times [2019-11-16 00:08:03,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:03,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134006296] [2019-11-16 00:08:03,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-11-16 00:08:04,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134006296] [2019-11-16 00:08:04,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:04,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:04,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427825] [2019-11-16 00:08:04,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:04,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:04,824 INFO L87 Difference]: Start difference. First operand 9008 states and 9268 transitions. Second operand 3 states. [2019-11-16 00:08:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:05,856 INFO L93 Difference]: Finished difference Result 18609 states and 19174 transitions. [2019-11-16 00:08:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:05,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 846 [2019-11-16 00:08:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:05,867 INFO L225 Difference]: With dead ends: 18609 [2019-11-16 00:08:05,867 INFO L226 Difference]: Without dead ends: 9902 [2019-11-16 00:08:05,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2019-11-16 00:08:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 9005. [2019-11-16 00:08:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-11-16 00:08:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 9244 transitions. [2019-11-16 00:08:05,981 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 9244 transitions. Word has length 846 [2019-11-16 00:08:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:05,982 INFO L462 AbstractCegarLoop]: Abstraction has 9005 states and 9244 transitions. [2019-11-16 00:08:05,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 9244 transitions. [2019-11-16 00:08:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2019-11-16 00:08:06,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:06,001 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:06,002 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1187839850, now seen corresponding path program 1 times [2019-11-16 00:08:06,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:06,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118495905] [2019-11-16 00:08:06,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 520 proven. 504 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:08:09,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118495905] [2019-11-16 00:08:09,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489089650] [2019-11-16 00:08:09,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:08:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:09,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:08:09,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:09,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-16 00:08:10,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:08:10,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-16 00:08:10,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151743713] [2019-11-16 00:08:10,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:10,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:10,331 INFO L87 Difference]: Start difference. First operand 9005 states and 9244 transitions. Second operand 3 states. [2019-11-16 00:08:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:12,330 INFO L93 Difference]: Finished difference Result 20711 states and 21268 transitions. [2019-11-16 00:08:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:12,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 867 [2019-11-16 00:08:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:12,344 INFO L225 Difference]: With dead ends: 20711 [2019-11-16 00:08:12,344 INFO L226 Difference]: Without dead ends: 12007 [2019-11-16 00:08:12,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 866 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12007 states. [2019-11-16 00:08:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12007 to 10805. [2019-11-16 00:08:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10805 states. [2019-11-16 00:08:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10805 states to 10805 states and 11090 transitions. [2019-11-16 00:08:12,558 INFO L78 Accepts]: Start accepts. Automaton has 10805 states and 11090 transitions. Word has length 867 [2019-11-16 00:08:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:12,559 INFO L462 AbstractCegarLoop]: Abstraction has 10805 states and 11090 transitions. [2019-11-16 00:08:12,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 10805 states and 11090 transitions. [2019-11-16 00:08:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-11-16 00:08:12,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:12,575 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-16 00:08:12,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:12,775 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash -568589825, now seen corresponding path program 1 times [2019-11-16 00:08:12,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:12,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244403418] [2019-11-16 00:08:12,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 676 proven. 641 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:08:16,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244403418] [2019-11-16 00:08:16,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980554394] [2019-11-16 00:08:16,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/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-16 00:08:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:08:16,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:08:16,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:08:16,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:08:16,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:16,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:17,294 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 25 [2019-11-16 00:08:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 988 proven. 325 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:08:20,254 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:20,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 19 [2019-11-16 00:08:20,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76909] [2019-11-16 00:08:20,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:08:20,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:08:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:08:20,256 INFO L87 Difference]: Start difference. First operand 10805 states and 11090 transitions. Second operand 19 states. [2019-11-16 00:10:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:10,573 INFO L93 Difference]: Finished difference Result 37011 states and 37975 transitions. [2019-11-16 00:10:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-16 00:10:10,574 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 900 [2019-11-16 00:10:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:10,601 INFO L225 Difference]: With dead ends: 37011 [2019-11-16 00:10:10,601 INFO L226 Difference]: Without dead ends: 26507 [2019-11-16 00:10:10,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 952 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1159, Invalid=5647, Unknown=0, NotChecked=0, Total=6806 [2019-11-16 00:10:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26507 states. [2019-11-16 00:10:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26507 to 18880. [2019-11-16 00:10:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18880 states. [2019-11-16 00:10:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18880 states to 18880 states and 19340 transitions. [2019-11-16 00:10:10,872 INFO L78 Accepts]: Start accepts. Automaton has 18880 states and 19340 transitions. Word has length 900 [2019-11-16 00:10:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:10,872 INFO L462 AbstractCegarLoop]: Abstraction has 18880 states and 19340 transitions. [2019-11-16 00:10:10,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:10:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18880 states and 19340 transitions. [2019-11-16 00:10:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2019-11-16 00:10:10,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:10,890 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:11,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:11,092 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:10:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1312472755, now seen corresponding path program 1 times [2019-11-16 00:10:11,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:11,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611761243] [2019-11-16 00:10:11,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-16 00:10:12,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611761243] [2019-11-16 00:10:12,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:12,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:10:12,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660803739] [2019-11-16 00:10:12,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:10:12,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:10:12,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:10:12,386 INFO L87 Difference]: Start difference. First operand 18880 states and 19340 transitions. Second operand 5 states. [2019-11-16 00:10:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:14,685 INFO L93 Difference]: Finished difference Result 25268 states and 25878 transitions. [2019-11-16 00:10:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:10:14,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 916 [2019-11-16 00:10:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:14,705 INFO L225 Difference]: With dead ends: 25268 [2019-11-16 00:10:14,705 INFO L226 Difference]: Without dead ends: 25266 [2019-11-16 00:10:14,709 INFO L600 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-16 00:10:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25266 states. [2019-11-16 00:10:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25266 to 18581. [2019-11-16 00:10:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18581 states. [2019-11-16 00:10:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18581 states to 18581 states and 19023 transitions. [2019-11-16 00:10:14,924 INFO L78 Accepts]: Start accepts. Automaton has 18581 states and 19023 transitions. Word has length 916 [2019-11-16 00:10:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:14,925 INFO L462 AbstractCegarLoop]: Abstraction has 18581 states and 19023 transitions. [2019-11-16 00:10:14,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:10:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18581 states and 19023 transitions. [2019-11-16 00:10:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2019-11-16 00:10:14,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:14,937 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:14,938 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:10:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1065104549, now seen corresponding path program 1 times [2019-11-16 00:10:14,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:14,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866897592] [2019-11-16 00:10:14,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:14,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:14,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1147 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-11-16 00:10:16,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866897592] [2019-11-16 00:10:16,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:16,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:10:16,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120912198] [2019-11-16 00:10:16,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:10:16,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:10:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:10:16,371 INFO L87 Difference]: Start difference. First operand 18581 states and 19023 transitions. Second operand 7 states. [2019-11-16 00:10:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:18,583 INFO L93 Difference]: Finished difference Result 37313 states and 38199 transitions. [2019-11-16 00:10:18,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:18,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 924 [2019-11-16 00:10:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:18,602 INFO L225 Difference]: With dead ends: 37313 [2019-11-16 00:10:18,602 INFO L226 Difference]: Without dead ends: 19033 [2019-11-16 00:10:18,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:10:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19033 states. [2019-11-16 00:10:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19033 to 18581. [2019-11-16 00:10:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18581 states. [2019-11-16 00:10:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18581 states to 18581 states and 19023 transitions. [2019-11-16 00:10:18,818 INFO L78 Accepts]: Start accepts. Automaton has 18581 states and 19023 transitions. Word has length 924 [2019-11-16 00:10:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:18,819 INFO L462 AbstractCegarLoop]: Abstraction has 18581 states and 19023 transitions. [2019-11-16 00:10:18,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:10:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18581 states and 19023 transitions. [2019-11-16 00:10:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2019-11-16 00:10:18,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:18,839 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-16 00:10:18,840 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:10:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2073923035, now seen corresponding path program 1 times [2019-11-16 00:10:18,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:18,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910262942] [2019-11-16 00:10:18,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:18,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:18,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-16 00:10:19,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910262942] [2019-11-16 00:10:19,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:19,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:10:19,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185492989] [2019-11-16 00:10:19,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:10:19,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:10:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:10:19,971 INFO L87 Difference]: Start difference. First operand 18581 states and 19023 transitions. Second operand 4 states. [2019-11-16 00:10:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:21,607 INFO L93 Difference]: Finished difference Result 40757 states and 41720 transitions. [2019-11-16 00:10:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:10:21,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 980 [2019-11-16 00:10:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:21,625 INFO L225 Difference]: With dead ends: 40757 [2019-11-16 00:10:21,625 INFO L226 Difference]: Without dead ends: 22178 [2019-11-16 00:10:21,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:10:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22178 states. [2019-11-16 00:10:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22178 to 14485. [2019-11-16 00:10:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14485 states. [2019-11-16 00:10:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14485 states to 14485 states and 14811 transitions. [2019-11-16 00:10:21,811 INFO L78 Accepts]: Start accepts. Automaton has 14485 states and 14811 transitions. Word has length 980 [2019-11-16 00:10:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:21,812 INFO L462 AbstractCegarLoop]: Abstraction has 14485 states and 14811 transitions. [2019-11-16 00:10:21,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:10:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 14485 states and 14811 transitions. [2019-11-16 00:10:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1086 [2019-11-16 00:10:21,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:21,829 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:21,829 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:10:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1970281170, now seen corresponding path program 1 times [2019-11-16 00:10:21,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:21,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76910553] [2019-11-16 00:10:21,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:21,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:21,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-11-16 00:10:23,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76910553] [2019-11-16 00:10:23,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:23,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:10:23,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294130772] [2019-11-16 00:10:23,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:10:23,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:23,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:10:23,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:10:23,160 INFO L87 Difference]: Start difference. First operand 14485 states and 14811 transitions. Second operand 5 states. [2019-11-16 00:10:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:25,839 INFO L93 Difference]: Finished difference Result 31668 states and 32362 transitions. [2019-11-16 00:10:25,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:10:25,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1085 [2019-11-16 00:10:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:25,840 INFO L225 Difference]: With dead ends: 31668 [2019-11-16 00:10:25,841 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:10:25,845 INFO L600 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-16 00:10:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:10:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:10:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:10:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:10:25,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1085 [2019-11-16 00:10:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:25,847 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:10:25,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:10:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:10:25,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:10:25,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:10:27,574 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 747 DAG size of output: 520 [2019-11-16 00:10:28,883 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 747 DAG size of output: 520 [2019-11-16 00:10:29,240 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 307 [2019-11-16 00:10:34,360 WARN L191 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 486 DAG size of output: 133 [2019-11-16 00:10:39,200 WARN L191 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 486 DAG size of output: 133 [2019-11-16 00:10:41,780 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 279 DAG size of output: 124 [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,784 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,785 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,786 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,787 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:10:41,789 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:10:41,789 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:10:41,789 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:10:41,789 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,789 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,789 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,790 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:10:41,791 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:10:41,792 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,793 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:10:41,794 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,795 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:10:41,797 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,797 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,798 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,799 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,799 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:10:41,799 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:10:41,799 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,799 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:10:41,799 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,800 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,800 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,800 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,800 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,801 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 190) no Hoare annotation was computed. [2019-11-16 00:10:41,801 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,801 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:10:41,801 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,801 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,802 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,802 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,802 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,802 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,802 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,802 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:10:41,803 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,803 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,803 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,803 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,803 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,803 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:10:41,804 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,804 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,804 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,804 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,804 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,804 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,805 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,805 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,805 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:10:41,805 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:10:41,805 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,805 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,806 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:10:41,806 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,806 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,806 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,806 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,806 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,807 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:10:41,807 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,807 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,807 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,807 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,808 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,808 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:10:41,808 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,808 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,808 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,808 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,809 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:10:41,809 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:10:41,809 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,809 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,809 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,809 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,810 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,810 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:10:41,810 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:10:41,810 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,810 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:10:41,810 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:10:41,811 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:10:41,811 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,811 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,811 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,811 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,811 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,812 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:10:41,812 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:10:41,812 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:10:41,812 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:10:41,812 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,812 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,813 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,813 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:10:41,813 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:10:41,813 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,813 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,813 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,814 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,814 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,814 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,814 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:10:41,814 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:10:41,814 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:10:41,815 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,815 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:10:41,815 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,815 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,815 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,815 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,816 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,816 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,816 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,816 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,816 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:10:41,816 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:10:41,817 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:10:41,817 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:10:41,817 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,817 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,817 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,817 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,818 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse34 (+ ~a4~0 86))) (let ((.cse4 (<= .cse34 0)) (.cse14 (<= 0 (+ ~a0~0 44))) (.cse21 (+ ~a0~0 147)) (.cse32 (+ ~a0~0 98))) (let ((.cse12 (= 1 ~a2~0)) (.cse22 (< 0 .cse32)) (.cse5 (+ ~a29~0 16)) (.cse16 (<= .cse21 0)) (.cse31 (= 4 ~a2~0)) (.cse9 (<= (+ ~a4~0 42) 0)) (.cse30 (let ((.cse35 (not (= 5 ~a2~0)))) (or (and .cse4 .cse35) (and .cse35 .cse14)))) (.cse1 (= 2 ~a2~0)) (.cse33 (+ ~a29~0 144))) (let ((.cse13 (<= (+ ~a4~0 89) 0)) (.cse15 (<= 0 (+ ~a29~0 127))) (.cse20 (< 0 .cse33)) (.cse3 (< 43 ~a29~0)) (.cse6 (and .cse9 .cse30 .cse1)) (.cse11 (< 0 .cse34)) (.cse7 (<= 0 .cse33)) (.cse19 (<= (+ ~a0~0 99) 0)) (.cse24 (and .cse9 .cse16 .cse31)) (.cse2 (<= 0 (+ ~a0~0 600000))) (.cse10 (< 0 .cse5)) (.cse17 (and .cse4 .cse22)) (.cse25 (not .cse1)) (.cse26 (not .cse12)) (.cse27 (not .cse31)) (.cse0 (<= .cse32 0)) (.cse29 (<= 0 (+ ~a29~0 1))) (.cse28 (= 3 ~a2~0)) (.cse8 (<= ~a29~0 43)) (.cse18 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= .cse5 0) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse6) (and .cse7 (and .cse8 .cse6)) (and .cse9 .cse10 .cse11 .cse12 .cse8 .cse2) (and .cse13 (and .cse12 .cse8) .cse14 .cse15) (and .cse9 .cse16 .cse1 .cse2) (and .cse17 .cse18) (and .cse13 .cse14 .cse6 .cse15) (and .cse2 .cse9 (= ~a2~0 1) .cse19 .cse20) (and .cse10 .cse2 (and .cse0 .cse9 .cse1)) (and .cse0 .cse9 .cse12 (< 0 .cse21)) (and .cse8 .cse18 .cse9 .cse12 .cse20 .cse22) (and .cse2 .cse3 .cse9 .cse19) (and (exists ((v_~a29~0_896 Int)) (let ((.cse23 (mod v_~a29~0_896 29))) (and (< 43 v_~a29~0_896) (= .cse23 0) (<= (+ .cse23 8) ~a29~0)))) (<= 123 ~a0~0) .cse6) (and .cse4 .cse16) (and (<= (+ ~a29~0 17) 0) .cse24 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse2) (and .cse9 .cse0 .cse25 .cse11 .cse26 .cse2 .cse27 .cse7) (and .cse9 .cse19 .cse28) (and .cse29 .cse24 .cse2) (and .cse10 (and .cse17 .cse25 .cse26 .cse27)) (and (and .cse4 .cse0) .cse29) (and .cse9 .cse8 .cse30 .cse28) (and .cse9 .cse30 .cse8 .cse31) (and .cse30 .cse1 .cse18)))))) [2019-11-16 00:10:41,819 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:10:41,819 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:10:41,819 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,819 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,819 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,819 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,820 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,820 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,820 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,820 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:10:41,820 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,820 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:10:41,821 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:10:41,821 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,821 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:10:41,821 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:10:41,821 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:10:41,821 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:10:41,822 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,822 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,822 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,822 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,823 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,823 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:10:41,823 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:10:41,824 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,824 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:10:41,825 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:10:41,825 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,825 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,825 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,826 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,826 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,826 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,827 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse35 (+ ~a4~0 86))) (let ((.cse34 (+ ~a0~0 98)) (.cse27 (+ ~a0~0 147)) (.cse1 (<= .cse35 0)) (.cse20 (<= 0 (+ ~a0~0 44)))) (let ((.cse31 (let ((.cse36 (not (= 5 ~a2~0)))) (or (and .cse1 .cse36) (and .cse36 .cse20)))) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse17 (< 0 .cse35)) (.cse22 (<= .cse27 0)) (.cse32 (= 4 ~a2~0)) (.cse9 (= 1 ~a2~0)) (.cse3 (= 2 ~a2~0)) (.cse14 (< 0 .cse34)) (.cse6 (+ ~a29~0 16)) (.cse29 (+ ~a29~0 144))) (let ((.cse11 (< 0 .cse29)) (.cse2 (<= .cse34 0)) (.cse0 (<= 0 (+ ~a29~0 1))) (.cse26 (<= 0 .cse29)) (.cse4 (< 43 ~a29~0)) (.cse16 (< 0 .cse6)) (.cse21 (and .cse1 .cse14)) (.cse23 (not .cse3)) (.cse24 (not .cse9)) (.cse25 (not .cse32)) (.cse28 (and .cse8 .cse17 .cse22 .cse32)) (.cse5 (<= 0 (+ ~a0~0 600000))) (.cse19 (or (and .cse9 .cse20) (and .cse1 .cse9))) (.cse10 (<= (+ ~a0~0 99) 0)) (.cse18 (<= (+ ~a4~0 89) 0)) (.cse15 (exists ((v_~a29~0_896 Int)) (let ((.cse33 (mod v_~a29~0_896 29))) (and (< 43 v_~a29~0_896) (= .cse33 0) (<= (+ .cse33 8) ~a29~0))))) (.cse7 (and .cse8 .cse31 .cse3)) (.cse30 (= 3 ~a2~0)) (.cse12 (<= ~a29~0 43)) (.cse13 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (and .cse1 .cse2)) (and (and (and .cse3 .cse4) .cse2) .cse5) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= .cse6 0) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse7) (and .cse5 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse8 .cse9 .cse11 .cse14) (and (<= 123 ~a0~0) (and .cse15 .cse7)) (and .cse8 .cse16 .cse17 .cse9 .cse12 .cse5) (and .cse18 (and .cse19 .cse12) .cse20 (<= 0 (+ ~a29~0 127))) (and .cse21 .cse13) (and .cse8 .cse22 .cse5 .cse3) (and .cse8 .cse2 .cse23 .cse17 .cse24 .cse5 .cse25 .cse26) (and .cse2 .cse8 .cse9 (< 0 .cse27)) (and .cse16 (and (and .cse2 .cse8 .cse3) .cse5)) (and (and .cse28 .cse5) .cse0) (and (and .cse12 .cse7) .cse26) (and .cse5 .cse4 .cse8 .cse10) (and .cse16 (and .cse21 .cse23 .cse24 .cse25)) (and .cse1 .cse22) (and (<= (+ ~a29~0 17) 0) .cse28 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse5) (and .cse1 .cse19 (<= .cse29 0)) (and .cse8 .cse10 .cse30) (and .cse18 .cse20 .cse15 .cse7) (and .cse8 .cse12 .cse31 .cse30) (and .cse8 .cse31 .cse12 .cse32) (and .cse31 .cse3 .cse13)))))) [2019-11-16 00:10:41,829 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,830 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:10:41,830 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:10:41,830 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,830 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,830 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,831 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,832 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:10:41,832 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,832 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,832 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,832 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,832 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,833 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,833 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:10:41,833 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:10:41,833 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,833 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,833 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,834 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,834 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,834 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,834 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:10:41,834 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:10:41,834 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,835 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:10:41,835 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,835 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,835 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,835 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,835 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,836 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,837 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,837 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,837 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,837 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,837 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:10:41,837 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:10:41,838 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,838 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,838 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,838 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,839 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,839 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,839 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,840 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:10:41,840 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:10:41,840 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,840 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:10:41,840 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:10:41,840 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,841 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,841 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,841 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,841 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,841 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,842 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse35 (+ ~a4~0 86))) (let ((.cse34 (+ ~a0~0 98)) (.cse27 (+ ~a0~0 147)) (.cse1 (<= .cse35 0)) (.cse20 (<= 0 (+ ~a0~0 44)))) (let ((.cse31 (let ((.cse36 (not (= 5 ~a2~0)))) (or (and .cse1 .cse36) (and .cse36 .cse20)))) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse17 (< 0 .cse35)) (.cse22 (<= .cse27 0)) (.cse32 (= 4 ~a2~0)) (.cse9 (= 1 ~a2~0)) (.cse3 (= 2 ~a2~0)) (.cse14 (< 0 .cse34)) (.cse6 (+ ~a29~0 16)) (.cse29 (+ ~a29~0 144))) (let ((.cse11 (< 0 .cse29)) (.cse2 (<= .cse34 0)) (.cse0 (<= 0 (+ ~a29~0 1))) (.cse26 (<= 0 .cse29)) (.cse4 (< 43 ~a29~0)) (.cse16 (< 0 .cse6)) (.cse21 (and .cse1 .cse14)) (.cse23 (not .cse3)) (.cse24 (not .cse9)) (.cse25 (not .cse32)) (.cse28 (and .cse8 .cse17 .cse22 .cse32)) (.cse5 (<= 0 (+ ~a0~0 600000))) (.cse19 (or (and .cse9 .cse20) (and .cse1 .cse9))) (.cse10 (<= (+ ~a0~0 99) 0)) (.cse18 (<= (+ ~a4~0 89) 0)) (.cse15 (exists ((v_~a29~0_896 Int)) (let ((.cse33 (mod v_~a29~0_896 29))) (and (< 43 v_~a29~0_896) (= .cse33 0) (<= (+ .cse33 8) ~a29~0))))) (.cse7 (and .cse8 .cse31 .cse3)) (.cse30 (= 3 ~a2~0)) (.cse12 (<= ~a29~0 43)) (.cse13 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (and .cse1 .cse2)) (and (and (and .cse3 .cse4) .cse2) .cse5) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= .cse6 0) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse7) (and .cse5 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse8 .cse9 .cse11 .cse14) (and (<= 123 ~a0~0) (and .cse15 .cse7)) (and .cse8 .cse16 .cse17 .cse9 .cse12 .cse5) (and .cse18 (and .cse19 .cse12) .cse20 (<= 0 (+ ~a29~0 127))) (and .cse21 .cse13) (and .cse8 .cse22 .cse5 .cse3) (and .cse8 .cse2 .cse23 .cse17 .cse24 .cse5 .cse25 .cse26) (and .cse2 .cse8 .cse9 (< 0 .cse27)) (and .cse16 (and (and .cse2 .cse8 .cse3) .cse5)) (and (and .cse28 .cse5) .cse0) (and (and .cse12 .cse7) .cse26) (and .cse5 .cse4 .cse8 .cse10) (and .cse16 (and .cse21 .cse23 .cse24 .cse25)) (and .cse1 .cse22) (and (<= (+ ~a29~0 17) 0) .cse28 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse5) (and .cse1 .cse19 (<= .cse29 0)) (and .cse8 .cse10 .cse30) (and .cse18 .cse20 .cse15 .cse7) (and .cse8 .cse12 .cse31 .cse30) (and .cse8 .cse31 .cse12 .cse32) (and .cse31 .cse3 .cse13)))))) [2019-11-16 00:10:41,842 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:10:41,842 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:10:41,842 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,843 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,843 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,843 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,843 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,843 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,843 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,844 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,844 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:10:41,844 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:10:41,844 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,844 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:10:41,844 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:10:41,845 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,845 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,845 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,845 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,845 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,845 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,846 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:10:41,846 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,846 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,846 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,846 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,846 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,847 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,848 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,848 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,848 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,848 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,848 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,848 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:10:41,849 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,849 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,849 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,849 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,849 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:10:41,849 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,850 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,851 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,851 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,851 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,851 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:10:41,851 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:10:41,851 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,852 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:10:41,852 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,852 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,852 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,852 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:10:41,852 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,853 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,853 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,853 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,853 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,853 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,853 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,854 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:10:41,854 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:10:41,854 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,854 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,854 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,854 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:10:41,855 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,855 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,855 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,855 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,855 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,855 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:10:41,856 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,856 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,856 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:10:41,856 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:10:41,856 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,856 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:10:41,857 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:10:41,857 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,857 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:10:41,857 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,857 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:10:41,857 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:10:41,858 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,858 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,858 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:10:41,858 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:10:41,858 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:10:41,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:41,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:10:41 BoogieIcfgContainer [2019-11-16 00:10:41,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:10:41,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:10:41,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:10:41,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:10:41,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:58" (3/4) ... [2019-11-16 00:10:41,958 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:10:42,005 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:10:42,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:10:42,060 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || ((((a4 + 86 <= 0 && !(3 == input)) && a29 + 16 <= 0) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (123 <= a0 && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && 0 <= a0 + 600000) && 0 <= a29 + 1)) || ((a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (0 < a29 + 16 && (((a4 + 86 <= 0 && 0 < a0 + 98) && !(2 == a2)) && !(1 == a2)) && !(4 == a2))) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a29 + 17 <= 0 && ((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && !(5 == input)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 89 <= 0 && 0 <= a0 + 44) && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) [2019-11-16 00:10:42,066 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || ((((a4 + 86 <= 0 && !(3 == input)) && a29 + 16 <= 0) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (123 <= a0 && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && 0 <= a0 + 600000) && 0 <= a29 + 1)) || ((a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (0 < a29 + 16 && (((a4 + 86 <= 0 && 0 < a0 + 98) && !(2 == a2)) && !(1 == a2)) && !(4 == a2))) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a29 + 17 <= 0 && ((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && !(5 == input)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 89 <= 0 && 0 <= a0 + 44) && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) [2019-11-16 00:10:42,083 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) || ((((a4 + 86 <= 0 && !(3 == input)) && a29 + 16 <= 0) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (0 <= a29 + 144 && a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && 1 == a2 && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 89 <= 0 && 0 <= a0 + 44) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 127)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && a2 == 1) && a0 + 99 <= 0) && 0 < a29 + 144)) || ((0 < a29 + 16 && 0 <= a0 + 600000) && (a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (((\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29) && 123 <= a0) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a29 + 17 <= 0 && (a4 + 42 <= 0 && a0 + 147 <= 0) && 4 == a2) && !(5 == input)) && 0 <= a0 + 600000)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((0 <= a29 + 1 && (a4 + 42 <= 0 && a0 + 147 <= 0) && 4 == a2) && 0 <= a0 + 600000)) || (0 < a29 + 16 && (((a4 + 86 <= 0 && 0 < a0 + 98) && !(2 == a2)) && !(1 == a2)) && !(4 == a2))) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && 0 <= a29 + 1)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) [2019-11-16 00:10:42,318 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6d6f6fbb-c115-4feb-a555-6aa9e708d08d/bin/uautomizer/witness.graphml [2019-11-16 00:10:42,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:10:42,320 INFO L168 Benchmark]: Toolchain (without parser) took 230202.74 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 944.7 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 505.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,320 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:10:42,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1428.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -102.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 286.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,321 INFO L168 Benchmark]: Boogie Preprocessor took 275.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 988.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,322 INFO L168 Benchmark]: RCFGBuilder took 4764.31 ms. Allocated memory is still 1.2 GB. Free memory was 988.5 MB in the beginning and 913.2 MB in the end (delta: 75.4 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,322 INFO L168 Benchmark]: TraceAbstraction took 223074.21 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 913.2 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,323 INFO L168 Benchmark]: Witness Printer took 366.06 ms. Allocated memory is still 4.3 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:10:42,325 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1428.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -102.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 286.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 275.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 988.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4764.31 ms. Allocated memory is still 1.2 GB. Free memory was 988.5 MB in the beginning and 913.2 MB in the end (delta: 75.4 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 223074.21 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 913.2 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 366.06 ms. Allocated memory is still 4.3 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 89.9 MB). Peak memory consumption was 89.9 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_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 190]: 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-16 00:10:42,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || ((((a4 + 86 <= 0 && !(3 == input)) && a29 + 16 <= 0) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (123 <= a0 && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && 0 <= a0 + 600000) && 0 <= a29 + 1)) || ((a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (0 < a29 + 16 && (((a4 + 86 <= 0 && 0 < a0 + 98) && !(2 == a2)) && !(1 == a2)) && !(4 == a2))) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a29 + 17 <= 0 && ((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && !(5 == input)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 89 <= 0 && 0 <= a0 + 44) && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:10:42,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((0 <= a29 + 1 && a4 + 86 <= 0 && a0 + 98 <= 0) || (((2 == a2 && 43 < a29) && a0 + 98 <= 0) && 0 <= a0 + 600000)) || ((((a4 + 86 <= 0 && !(3 == input)) && a29 + 16 <= 0) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && 1 == a2) && a0 + 99 <= 0) && 0 < a29 + 144)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (123 <= a0 && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (0 < a29 + 16 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && 0 <= a0 + 600000) && 0 <= a29 + 1)) || ((a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 144)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (0 < a29 + 16 && (((a4 + 86 <= 0 && 0 < a0 + 98) && !(2 == a2)) && !(1 == a2)) && !(4 == a2))) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a29 + 17 <= 0 && ((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && !(5 == input)) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 89 <= 0 && 0 <= a0 + 44) && (\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:10:42,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-16 00:10:42,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a0 + 98 <= 0 && 2 == a2) && 0 <= a0 + 600000) && 43 < a29) || ((((a4 + 86 <= 0 && !(3 == input)) && a29 + 16 <= 0) && !(4 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (0 <= a29 + 144 && a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || (((a4 + 89 <= 0 && 1 == a2 && a29 <= 43) && 0 <= a0 + 44) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 600000)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 89 <= 0 && 0 <= a0 + 44) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 127)) || ((((0 <= a0 + 600000 && a4 + 42 <= 0) && a2 == 1) && a0 + 99 <= 0) && 0 < a29 + 144)) || ((0 < a29 + 16 && 0 <= a0 + 600000) && (a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || (((((a29 <= 43 && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && 0 < a0 + 98)) || (((0 <= a0 + 600000 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0)) || (((\exists v_~a29~0_896 : int :: (43 < v_~a29~0_896 && v_~a29~0_896 % 29 == 0) && v_~a29~0_896 % 29 + 8 <= a29) && 123 <= a0) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a29 + 17 <= 0 && (a4 + 42 <= 0 && a0 + 147 <= 0) && 4 == a2) && !(5 == input)) && 0 <= a0 + 600000)) || (((((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(2 == a2)) && 0 < a4 + 86) && !(1 == a2)) && 0 <= a0 + 600000) && !(4 == a2)) && 0 <= a29 + 144)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((0 <= a29 + 1 && (a4 + 42 <= 0 && a0 + 147 <= 0) && 4 == a2) && 0 <= a0 + 600000)) || (0 < a29 + 16 && (((a4 + 86 <= 0 && 0 < a0 + 98) && !(2 == a2)) && !(1 == a2)) && !(4 == a2))) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && 0 <= a29 + 1)) || (((a4 + 42 <= 0 && a29 <= 43) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0) - 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: 222.8s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 171.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.9s, HoareTripleCheckerStatistics: 5744 SDtfs, 21893 SDslu, 1471 SDs, 0 SdLazy, 55336 SolverSat, 5215 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 152.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3930 GetRequests, 3763 SyntacticMatches, 17 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2263 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18880occurred in iteration=17, 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, 21 MinimizatonAttempts, 30870 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 239 NumberOfFragments, 2139 HoareAnnotationTreeSize, 4 FomulaSimplifications, 173289 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 86165 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 16815 NumberOfCodeBlocks, 16815 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 16788 ConstructedInterpolants, 422 QuantifiedInterpolants, 56416493 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4434 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 20248/21769 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...