./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.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_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/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 bb52621d262b2a79ebd79f9601fb8103d2f4f11e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:45:15,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:15,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:15,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:15,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:15,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:15,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:15,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:15,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:15,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:15,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:15,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:15,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:15,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:15,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:15,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:15,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:15,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:15,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:15,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:15,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:15,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:15,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:15,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:15,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:15,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:15,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:15,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:15,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:15,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:15,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:15,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:15,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:15,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:15,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:15,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:15,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:15,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:15,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:15,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:15,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:15,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:45:15,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:15,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:15,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:15,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:15,971 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:15,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:15,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:15,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:15,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:15,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:15,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:45:15,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:15,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:45:15,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:15,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:15,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:15,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:45:15,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:15,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:15,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:15,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:15,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:15,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:15,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:15,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:45:15,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:15,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:45:15,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:45:15,978 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_25ab792e-a7ca-4579-85b0-a7ab081c3962/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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2019-11-15 23:45:16,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:16,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:16,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:16,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:16,030 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:16,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-15 23:45:16,102 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/data/49b8c1254/ef7fa5683962457dbff0d5b47ec707cb/FLAG7d18de095 [2019-11-15 23:45:16,491 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:16,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-15 23:45:16,500 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/data/49b8c1254/ef7fa5683962457dbff0d5b47ec707cb/FLAG7d18de095 [2019-11-15 23:45:16,923 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/data/49b8c1254/ef7fa5683962457dbff0d5b47ec707cb [2019-11-15 23:45:16,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:16,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:16,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:16,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:16,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:16,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:16" (1/1) ... [2019-11-15 23:45:16,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b3b44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:16, skipping insertion in model container [2019-11-15 23:45:16,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:16" (1/1) ... [2019-11-15 23:45:16,947 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:16,996 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:17,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:17,279 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:17,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:17,355 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:17,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17 WrapperNode [2019-11-15 23:45:17,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:17,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:17,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:17,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:17,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:17,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:17,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:17,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:17,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... [2019-11-15 23:45:17,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:17,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:17,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:17,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:17,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/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-15 23:45:17,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:17,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:18,306 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:18,306 INFO L284 CfgBuilder]: Removed 64 assume(true) statements. [2019-11-15 23:45:18,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:18 BoogieIcfgContainer [2019-11-15 23:45:18,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:18,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:45:18,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:45:18,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:45:18,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:16" (1/3) ... [2019-11-15 23:45:18,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543a0211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:18, skipping insertion in model container [2019-11-15 23:45:18,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:17" (2/3) ... [2019-11-15 23:45:18,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543a0211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:18, skipping insertion in model container [2019-11-15 23:45:18,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:18" (3/3) ... [2019-11-15 23:45:18,317 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-11-15 23:45:18,328 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:45:18,336 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:45:18,348 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:45:18,374 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:45:18,374 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:45:18,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:45:18,375 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:18,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:18,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:45:18,375 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:18,375 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:45:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-15 23:45:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:45:18,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:18,402 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] [2019-11-15 23:45:18,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:18,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:18,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-11-15 23:45:18,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:18,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80091451] [2019-11-15 23:45:18,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:18,563 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-15 23:45:18,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80091451] [2019-11-15 23:45:18,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:18,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:18,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631728177] [2019-11-15 23:45:18,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:18,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,584 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-11-15 23:45:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:18,634 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-11-15 23:45:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:18,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:45:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:18,648 INFO L225 Difference]: With dead ends: 210 [2019-11-15 23:45:18,648 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:45:18,652 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-15 23:45:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:45:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 23:45:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:45:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-11-15 23:45:18,698 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-11-15 23:45:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:18,699 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-11-15 23:45:18,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-11-15 23:45:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:45:18,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:18,702 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, 1, 1, 1, 1, 1] [2019-11-15 23:45:18,703 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-11-15 23:45:18,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:18,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529097968] [2019-11-15 23:45:18,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:18,787 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-15 23:45:18,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529097968] [2019-11-15 23:45:18,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:18,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:18,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304719630] [2019-11-15 23:45:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:18,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,791 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-11-15 23:45:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:18,817 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-11-15 23:45:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:18,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:45:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:18,820 INFO L225 Difference]: With dead ends: 199 [2019-11-15 23:45:18,820 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:45:18,822 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-15 23:45:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:45:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 23:45:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:45:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-11-15 23:45:18,834 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-11-15 23:45:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:18,835 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-11-15 23:45:18,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-11-15 23:45:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:45:18,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:18,838 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:18,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:18,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-11-15 23:45:18,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:18,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405681254] [2019-11-15 23:45:18,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:18,921 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-15 23:45:18,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405681254] [2019-11-15 23:45:18,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:18,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:18,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672090094] [2019-11-15 23:45:18,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:18,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:18,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,924 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-11-15 23:45:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:18,948 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-11-15 23:45:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:18,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 23:45:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:18,950 INFO L225 Difference]: With dead ends: 196 [2019-11-15 23:45:18,950 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:45:18,951 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-15 23:45:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:45:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 23:45:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:45:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-11-15 23:45:18,978 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-11-15 23:45:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:18,979 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-11-15 23:45:18,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-11-15 23:45:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:45:18,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:18,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:18,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-11-15 23:45:18,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:18,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573058400] [2019-11-15 23:45:18,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,055 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-15 23:45:19,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573058400] [2019-11-15 23:45:19,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527217726] [2019-11-15 23:45:19,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,057 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-11-15 23:45:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,081 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-11-15 23:45:19,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 23:45:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,084 INFO L225 Difference]: With dead ends: 193 [2019-11-15 23:45:19,084 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:45:19,085 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-15 23:45:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:45:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 23:45:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:45:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-11-15 23:45:19,102 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-11-15 23:45:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,103 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-11-15 23:45:19,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-11-15 23:45:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:45:19,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:19,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-11-15 23:45:19,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367458544] [2019-11-15 23:45:19,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,240 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-15 23:45:19,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367458544] [2019-11-15 23:45:19,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482470447] [2019-11-15 23:45:19,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,243 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-11-15 23:45:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,304 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-11-15 23:45:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-15 23:45:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,307 INFO L225 Difference]: With dead ends: 271 [2019-11-15 23:45:19,307 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 23:45:19,309 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-15 23:45:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 23:45:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-11-15 23:45:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 23:45:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-11-15 23:45:19,334 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-11-15 23:45:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,334 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-11-15 23:45:19,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-11-15 23:45:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:45:19,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:19,338 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-11-15 23:45:19,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533069056] [2019-11-15 23:45:19,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,419 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-15 23:45:19,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533069056] [2019-11-15 23:45:19,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931042076] [2019-11-15 23:45:19,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,423 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-11-15 23:45:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,521 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-11-15 23:45:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-15 23:45:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,526 INFO L225 Difference]: With dead ends: 536 [2019-11-15 23:45:19,526 INFO L226 Difference]: Without dead ends: 371 [2019-11-15 23:45:19,528 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-15 23:45:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-15 23:45:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-11-15 23:45:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:45:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-11-15 23:45:19,595 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-11-15 23:45:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,595 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-11-15 23:45:19,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-11-15 23:45:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:45:19,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:19,601 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-11-15 23:45:19,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951727769] [2019-11-15 23:45:19,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,703 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-15 23:45:19,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951727769] [2019-11-15 23:45:19,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828258645] [2019-11-15 23:45:19,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,718 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-11-15 23:45:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,803 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-11-15 23:45:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-15 23:45:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,808 INFO L225 Difference]: With dead ends: 697 [2019-11-15 23:45:19,808 INFO L226 Difference]: Without dead ends: 408 [2019-11-15 23:45:19,810 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-15 23:45:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-15 23:45:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-15 23:45:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 23:45:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-11-15 23:45:19,854 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-11-15 23:45:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,859 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-11-15 23:45:19,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-11-15 23:45:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:45:19,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:19,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-11-15 23:45:19,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123664924] [2019-11-15 23:45:19,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,992 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-15 23:45:19,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123664924] [2019-11-15 23:45:19,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179843428] [2019-11-15 23:45:19,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,998 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-11-15 23:45:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,090 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-11-15 23:45:20,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-15 23:45:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,099 INFO L225 Difference]: With dead ends: 1166 [2019-11-15 23:45:20,099 INFO L226 Difference]: Without dead ends: 805 [2019-11-15 23:45:20,101 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-15 23:45:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-15 23:45:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-11-15 23:45:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-11-15 23:45:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-11-15 23:45:20,149 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-11-15 23:45:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,150 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-11-15 23:45:20,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-11-15 23:45:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:45:20,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:20,156 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-11-15 23:45:20,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160282360] [2019-11-15 23:45:20,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,229 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-15 23:45:20,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160282360] [2019-11-15 23:45:20,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94546333] [2019-11-15 23:45:20,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,233 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-11-15 23:45:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,301 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-11-15 23:45:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-15 23:45:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,308 INFO L225 Difference]: With dead ends: 1533 [2019-11-15 23:45:20,309 INFO L226 Difference]: Without dead ends: 926 [2019-11-15 23:45:20,310 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-15 23:45:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-15 23:45:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-15 23:45:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-15 23:45:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-11-15 23:45:20,357 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-11-15 23:45:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,358 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-11-15 23:45:20,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-11-15 23:45:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:45:20,363 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:20,364 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-11-15 23:45:20,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371834609] [2019-11-15 23:45:20,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,441 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-15 23:45:20,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371834609] [2019-11-15 23:45:20,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708043167] [2019-11-15 23:45:20,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,454 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-11-15 23:45:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,522 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-11-15 23:45:20,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-15 23:45:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,527 INFO L225 Difference]: With dead ends: 1353 [2019-11-15 23:45:20,527 INFO L226 Difference]: Without dead ends: 622 [2019-11-15 23:45:20,528 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-15 23:45:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-15 23:45:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-11-15 23:45:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-15 23:45:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-11-15 23:45:20,555 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-11-15 23:45:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,555 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-11-15 23:45:20,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-11-15 23:45:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:45:20,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:20,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-11-15 23:45:20,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411629801] [2019-11-15 23:45:20,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,605 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-15 23:45:20,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411629801] [2019-11-15 23:45:20,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169783626] [2019-11-15 23:45:20,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,608 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-11-15 23:45:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,654 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-11-15 23:45:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-15 23:45:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,658 INFO L225 Difference]: With dead ends: 921 [2019-11-15 23:45:20,658 INFO L226 Difference]: Without dead ends: 442 [2019-11-15 23:45:20,659 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-15 23:45:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-15 23:45:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-11-15 23:45:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-11-15 23:45:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-11-15 23:45:20,679 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-11-15 23:45:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,679 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-11-15 23:45:20,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-11-15 23:45:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:45:20,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:20,682 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-11-15 23:45:20,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443811963] [2019-11-15 23:45:20,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,735 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-15 23:45:20,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443811963] [2019-11-15 23:45:20,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152889510] [2019-11-15 23:45:20,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,738 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-11-15 23:45:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,759 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-11-15 23:45:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-15 23:45:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,763 INFO L225 Difference]: With dead ends: 617 [2019-11-15 23:45:20,763 INFO L226 Difference]: Without dead ends: 344 [2019-11-15 23:45:20,764 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-15 23:45:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-15 23:45:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-15 23:45:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-15 23:45:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-11-15 23:45:20,781 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-11-15 23:45:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,782 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-11-15 23:45:20,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-11-15 23:45:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:45:20,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:20,785 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-11-15 23:45:20,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985507759] [2019-11-15 23:45:20,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,830 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-15 23:45:20,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985507759] [2019-11-15 23:45:20,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753438593] [2019-11-15 23:45:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,838 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-11-15 23:45:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,895 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-11-15 23:45:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-15 23:45:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,900 INFO L225 Difference]: With dead ends: 922 [2019-11-15 23:45:20,902 INFO L226 Difference]: Without dead ends: 665 [2019-11-15 23:45:20,903 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-15 23:45:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-15 23:45:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-11-15 23:45:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-15 23:45:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-11-15 23:45:20,933 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-11-15 23:45:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,933 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-11-15 23:45:20,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-11-15 23:45:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:45:20,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:20,936 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-11-15 23:45:20,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041630032] [2019-11-15 23:45:20,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,965 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-15 23:45:20,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041630032] [2019-11-15 23:45:20,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224102672] [2019-11-15 23:45:20,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,968 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-11-15 23:45:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,035 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-11-15 23:45:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-15 23:45:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,041 INFO L225 Difference]: With dead ends: 1151 [2019-11-15 23:45:21,041 INFO L226 Difference]: Without dead ends: 782 [2019-11-15 23:45:21,043 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-15 23:45:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-15 23:45:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-11-15 23:45:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-15 23:45:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-11-15 23:45:21,079 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-11-15 23:45:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,080 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-11-15 23:45:21,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-11-15 23:45:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:45:21,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:21,083 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-11-15 23:45:21,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344806925] [2019-11-15 23:45:21,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,110 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-15 23:45:21,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344806925] [2019-11-15 23:45:21,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:21,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:21,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857925711] [2019-11-15 23:45:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:21,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:21,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:21,113 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-11-15 23:45:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,171 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-11-15 23:45:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-15 23:45:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,176 INFO L225 Difference]: With dead ends: 1061 [2019-11-15 23:45:21,177 INFO L226 Difference]: Without dead ends: 572 [2019-11-15 23:45:21,180 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-15 23:45:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-15 23:45:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-11-15 23:45:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-11-15 23:45:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-11-15 23:45:21,210 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-11-15 23:45:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,210 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-11-15 23:45:21,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-11-15 23:45:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:45:21,212 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:21,214 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-11-15 23:45:21,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641444550] [2019-11-15 23:45:21,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,255 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-15 23:45:21,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641444550] [2019-11-15 23:45:21,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:21,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:21,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704863861] [2019-11-15 23:45:21,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:21,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:21,265 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-11-15 23:45:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,293 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-11-15 23:45:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-15 23:45:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,297 INFO L225 Difference]: With dead ends: 741 [2019-11-15 23:45:21,297 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 23:45:21,298 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-15 23:45:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 23:45:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-11-15 23:45:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-15 23:45:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-11-15 23:45:21,324 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-11-15 23:45:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,324 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-11-15 23:45:21,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-11-15 23:45:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:45:21,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:21,327 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-11-15 23:45:21,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376721521] [2019-11-15 23:45:21,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,372 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-15 23:45:21,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376721521] [2019-11-15 23:45:21,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:21,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:21,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070566461] [2019-11-15 23:45:21,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:21,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:21,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:21,374 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-11-15 23:45:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,478 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-11-15 23:45:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-15 23:45:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,485 INFO L225 Difference]: With dead ends: 1220 [2019-11-15 23:45:21,486 INFO L226 Difference]: Without dead ends: 909 [2019-11-15 23:45:21,487 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-15 23:45:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-15 23:45:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-11-15 23:45:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-15 23:45:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-11-15 23:45:21,538 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-11-15 23:45:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,539 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-11-15 23:45:21,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-11-15 23:45:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:45:21,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:21,543 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-11-15 23:45:21,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058840880] [2019-11-15 23:45:21,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,586 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-15 23:45:21,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058840880] [2019-11-15 23:45:21,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:21,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:21,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749742664] [2019-11-15 23:45:21,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:21,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:21,588 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-11-15 23:45:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,682 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-11-15 23:45:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-15 23:45:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,690 INFO L225 Difference]: With dead ends: 1075 [2019-11-15 23:45:21,690 INFO L226 Difference]: Without dead ends: 1072 [2019-11-15 23:45:21,691 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-15 23:45:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-11-15 23:45:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-11-15 23:45:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-11-15 23:45:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-11-15 23:45:21,750 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-11-15 23:45:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,751 INFO L462 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-11-15 23:45:21,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-11-15 23:45:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 23:45:21,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:21,755 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-11-15 23:45:21,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271615015] [2019-11-15 23:45:21,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,793 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-15 23:45:21,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271615015] [2019-11-15 23:45:21,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:21,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:21,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405990799] [2019-11-15 23:45:21,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:21,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:21,797 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-11-15 23:45:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,863 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-11-15 23:45:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-15 23:45:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,871 INFO L225 Difference]: With dead ends: 1999 [2019-11-15 23:45:21,871 INFO L226 Difference]: Without dead ends: 1006 [2019-11-15 23:45:21,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-15 23:45:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-15 23:45:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-11-15 23:45:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-15 23:45:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-11-15 23:45:21,927 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-11-15 23:45:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,927 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-11-15 23:45:21,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-11-15 23:45:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:45:21,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,930 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:21,930 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-11-15 23:45:21,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859214575] [2019-11-15 23:45:21,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:21,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859214575] [2019-11-15 23:45:21,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:21,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:21,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772796884] [2019-11-15 23:45:21,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:21,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:21,978 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-11-15 23:45:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:22,054 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-11-15 23:45:22,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:22,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 23:45:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:22,061 INFO L225 Difference]: With dead ends: 1579 [2019-11-15 23:45:22,061 INFO L226 Difference]: Without dead ends: 940 [2019-11-15 23:45:22,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-15 23:45:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-15 23:45:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-15 23:45:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-11-15 23:45:22,125 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-11-15 23:45:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:22,125 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-11-15 23:45:22,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-11-15 23:45:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:45:22,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:22,128 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:22,128 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-11-15 23:45:22,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:22,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785230834] [2019-11-15 23:45:22,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:22,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785230834] [2019-11-15 23:45:22,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:22,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:22,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256164217] [2019-11-15 23:45:22,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:22,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:22,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:22,190 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-11-15 23:45:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:22,278 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-11-15 23:45:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:22,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:45:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:22,284 INFO L225 Difference]: With dead ends: 1579 [2019-11-15 23:45:22,284 INFO L226 Difference]: Without dead ends: 940 [2019-11-15 23:45:22,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-15 23:45:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-15 23:45:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-15 23:45:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-11-15 23:45:22,358 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-11-15 23:45:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:22,359 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-11-15 23:45:22,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-11-15 23:45:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:45:22,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:22,362 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:22,362 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-11-15 23:45:22,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:22,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385168946] [2019-11-15 23:45:22,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:22,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385168946] [2019-11-15 23:45:22,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:22,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:22,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393408998] [2019-11-15 23:45:22,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:22,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:22,396 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-11-15 23:45:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:22,534 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-11-15 23:45:22,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:22,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-15 23:45:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:22,545 INFO L225 Difference]: With dead ends: 2176 [2019-11-15 23:45:22,545 INFO L226 Difference]: Without dead ends: 1537 [2019-11-15 23:45:22,547 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-15 23:45:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-11-15 23:45:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-11-15 23:45:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-15 23:45:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-11-15 23:45:22,645 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-11-15 23:45:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:22,645 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-11-15 23:45:22,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-11-15 23:45:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:45:22,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:22,648 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:22,649 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-11-15 23:45:22,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:22,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826738534] [2019-11-15 23:45:22,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:22,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826738534] [2019-11-15 23:45:22,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:22,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:22,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539334030] [2019-11-15 23:45:22,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:22,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:22,697 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-11-15 23:45:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:22,808 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-11-15 23:45:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:22,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 23:45:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:22,814 INFO L225 Difference]: With dead ends: 1591 [2019-11-15 23:45:22,814 INFO L226 Difference]: Without dead ends: 934 [2019-11-15 23:45:22,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-15 23:45:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-15 23:45:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-15 23:45:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-11-15 23:45:22,895 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-11-15 23:45:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:22,896 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-11-15 23:45:22,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-11-15 23:45:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:45:22,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:22,898 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:22,899 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-11-15 23:45:22,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:22,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161770615] [2019-11-15 23:45:22,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:22,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161770615] [2019-11-15 23:45:22,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:22,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:22,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072837817] [2019-11-15 23:45:22,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:22,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:22,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:22,935 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-11-15 23:45:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:23,070 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-11-15 23:45:23,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:23,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-15 23:45:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:23,081 INFO L225 Difference]: With dead ends: 2188 [2019-11-15 23:45:23,081 INFO L226 Difference]: Without dead ends: 1555 [2019-11-15 23:45:23,082 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-15 23:45:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-15 23:45:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-11-15 23:45:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-15 23:45:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-11-15 23:45:23,180 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-11-15 23:45:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:23,181 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-11-15 23:45:23,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-11-15 23:45:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:45:23,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:23,183 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:23,184 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-11-15 23:45:23,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:23,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775337004] [2019-11-15 23:45:23,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:23,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775337004] [2019-11-15 23:45:23,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:23,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:23,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103656198] [2019-11-15 23:45:23,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:23,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:23,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:23,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:23,220 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-11-15 23:45:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:23,371 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-11-15 23:45:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:23,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-15 23:45:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:23,381 INFO L225 Difference]: With dead ends: 2220 [2019-11-15 23:45:23,381 INFO L226 Difference]: Without dead ends: 1563 [2019-11-15 23:45:23,383 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-15 23:45:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-15 23:45:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-11-15 23:45:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-15 23:45:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-11-15 23:45:23,525 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-11-15 23:45:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:23,525 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-11-15 23:45:23,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-11-15 23:45:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:45:23,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:23,529 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:23,529 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-11-15 23:45:23,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:23,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383927928] [2019-11-15 23:45:23,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:23,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383927928] [2019-11-15 23:45:23,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433438073] [2019-11-15 23:45:23,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/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-15 23:45:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:45:23,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:23,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:45:23,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-15 23:45:23,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130523184] [2019-11-15 23:45:23,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:23,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:23,889 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 4 states. [2019-11-15 23:45:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:24,127 INFO L93 Difference]: Finished difference Result 2609 states and 3234 transitions. [2019-11-15 23:45:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:24,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:45:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:24,141 INFO L225 Difference]: With dead ends: 2609 [2019-11-15 23:45:24,141 INFO L226 Difference]: Without dead ends: 1906 [2019-11-15 23:45:24,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-15 23:45:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1610. [2019-11-15 23:45:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-11-15 23:45:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-11-15 23:45:24,338 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-11-15 23:45:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:24,339 INFO L462 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-11-15 23:45:24,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-11-15 23:45:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:45:24,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:24,343 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:24,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:24,548 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-11-15 23:45:24,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:24,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015385601] [2019-11-15 23:45:24,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:24,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:24,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:24,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015385601] [2019-11-15 23:45:24,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:24,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:24,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606385029] [2019-11-15 23:45:24,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:24,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:24,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:24,591 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-11-15 23:45:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:24,880 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-11-15 23:45:24,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:24,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-15 23:45:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:24,898 INFO L225 Difference]: With dead ends: 3706 [2019-11-15 23:45:24,898 INFO L226 Difference]: Without dead ends: 2603 [2019-11-15 23:45:24,901 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-15 23:45:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-11-15 23:45:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-11-15 23:45:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-15 23:45:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-11-15 23:45:25,116 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-11-15 23:45:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:25,116 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-11-15 23:45:25,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-11-15 23:45:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:45:25,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:25,120 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:45:25,120 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-11-15 23:45:25,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:25,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429934854] [2019-11-15 23:45:25,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:25,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:25,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:25,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429934854] [2019-11-15 23:45:25,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:25,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:25,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83696334] [2019-11-15 23:45:25,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:25,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:25,182 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-11-15 23:45:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:25,341 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-11-15 23:45:25,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:25,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:45:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:25,342 INFO L225 Difference]: With dead ends: 1970 [2019-11-15 23:45:25,342 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:45:25,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:45:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:45:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:45:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:45:25,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-15 23:45:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:25,347 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:45:25,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:45:25,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:45:25,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:45:25,560 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-15 23:45:25,736 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-15 23:45:26,025 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-15 23:45:26,526 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-15 23:45:26,639 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-15 23:45:27,495 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-15 23:45:28,315 WARN L191 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-15 23:45:29,449 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:30,139 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-15 23:45:30,571 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-15 23:45:30,825 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-15 23:45:30,928 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-15 23:45:31,954 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-15 23:45:32,231 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-15 23:45:32,706 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-15 23:45:33,620 WARN L191 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:33,843 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-15 23:45:34,313 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-15 23:45:34,546 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-15 23:45:35,144 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-15 23:45:35,707 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-15 23:45:36,123 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-15 23:45:36,918 WARN L191 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:37,106 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-15 23:45:37,763 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:38,090 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-15 23:45:38,488 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-15 23:45:38,777 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-15 23:45:38,976 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-15 23:45:39,636 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:39,820 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-15 23:45:40,430 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:40,868 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-15 23:45:41,525 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-15 23:45:42,223 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-15 23:45:43,019 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-15 23:45:43,022 INFO L443 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-11-15 23:45:43,022 INFO L446 ceAbstractionStarter]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-11-15 23:45:43,022 INFO L439 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-15 23:45:43,022 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-11-15 23:45:43,023 INFO L439 ceAbstractionStarter]: At program point L202-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (= 1 ~d1_req_up~0)) (.cse3 (<= 2 ~d0_ev~0)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= 1 ~b1_req_up~0)) (.cse15 (= 1 ~d0_req_up~0)) (.cse16 (<= 2 ~z_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~b0_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-11-15 23:45:43,023 INFO L443 ceAbstractionStarter]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-11-15 23:45:43,023 INFO L439 ceAbstractionStarter]: At program point L202-3(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-15 23:45:43,023 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L443 ceAbstractionStarter]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L443 ceAbstractionStarter]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L443 ceAbstractionStarter]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-11-15 23:45:43,024 INFO L439 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-15 23:45:43,025 INFO L439 ceAbstractionStarter]: At program point L405(lines 389 407) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-11-15 23:45:43,025 INFO L443 ceAbstractionStarter]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-11-15 23:45:43,026 INFO L439 ceAbstractionStarter]: At program point L209(lines 201 239) the Hoare annotation is: (let ((.cse12 (= ~b0_ev~0 0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (= 1 ~d1_req_up~0)) (.cse3 (<= 2 ~d0_ev~0)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse20 (<= 2 ~b0_ev~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (= 1 ~d0_req_up~0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-15 23:45:43,026 INFO L439 ceAbstractionStarter]: At program point L209-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-15 23:45:43,026 INFO L443 ceAbstractionStarter]: For program point L276(line 276) no Hoare annotation was computed. [2019-11-15 23:45:43,026 INFO L443 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,026 INFO L443 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,026 INFO L443 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-15 23:45:43,026 INFO L443 ceAbstractionStarter]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L439 ceAbstractionStarter]: At program point L245-1(lines 311 315) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse11 (= ~b0_ev~0 0)) (.cse8 (= 0 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,027 INFO L443 ceAbstractionStarter]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L439 ceAbstractionStarter]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0)) [2019-11-15 23:45:43,027 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L443 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-11-15 23:45:43,027 INFO L439 ceAbstractionStarter]: At program point L380-2(lines 344 348) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,028 INFO L443 ceAbstractionStarter]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-11-15 23:45:43,028 INFO L439 ceAbstractionStarter]: At program point L380-5(lines 344 348) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-15 23:45:43,028 INFO L439 ceAbstractionStarter]: At program point L480(lines 451 482) the Hoare annotation is: (and (<= 0 ~z_val~0) (= 1 ~d1_req_up~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 2 ~d1_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (= 0 ~z_val_t~0) (<= ~z_val~0 0) (= 1 ~b0_req_up~0) (<= 1 ~d0_val_t~0) (= 1 ~b1_req_up~0) (= 1 ~d0_req_up~0) (<= 2 ~z_ev~0)) [2019-11-15 23:45:43,028 INFO L439 ceAbstractionStarter]: At program point L216(lines 201 239) the Hoare annotation is: (let ((.cse21 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b0_ev~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (= 1 ~d1_req_up~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~d1_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse9 (= 0 ~d0_ev~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 1 ~d0_val_t~0)) (.cse15 (<= ~b0_req_up~0 0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-15 23:45:43,029 INFO L439 ceAbstractionStarter]: At program point L216-1(lines 201 239) the Hoare annotation is: (let ((.cse8 (= 0 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse17 (<= 2 ~comp_m1_st~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse16 (<= 1 ~d1_val~0)) (.cse18 (= 0 ~z_val_t~0)) (.cse7 (<= ~z_val~0 0)) (.cse9 (<= 1 ~d0_val~0)) (.cse10 (<= 1 ~d0_val_t~0)) (.cse11 (<= ~b0_req_up~0 0)) (.cse12 (<= ~b1_req_up~0 0)) (.cse13 (<= 2 ~z_ev~0)) (.cse14 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-15 23:45:43,029 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:45:43,030 INFO L439 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,030 INFO L439 ceAbstractionStarter]: At program point L119-1(lines 96 121) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-15 23:45:43,031 INFO L439 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-15 23:45:43,031 INFO L439 ceAbstractionStarter]: At program point L120(lines 93 122) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,031 INFO L439 ceAbstractionStarter]: At program point L120-1(lines 93 122) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-15 23:45:43,032 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-11-15 23:45:43,032 INFO L443 ceAbstractionStarter]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-11-15 23:45:43,032 INFO L443 ceAbstractionStarter]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-11-15 23:45:43,032 INFO L443 ceAbstractionStarter]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-11-15 23:45:43,032 INFO L443 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,032 INFO L443 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,033 INFO L443 ceAbstractionStarter]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,033 INFO L443 ceAbstractionStarter]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,033 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-11-15 23:45:43,033 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:45:43,034 INFO L439 ceAbstractionStarter]: At program point L223(lines 201 239) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse11 (= ~b0_ev~0 0)) (.cse8 (= 0 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,034 INFO L439 ceAbstractionStarter]: At program point L223-1(lines 201 239) the Hoare annotation is: (let ((.cse8 (= 0 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse17 (<= 2 ~comp_m1_st~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse16 (<= 1 ~d1_val~0)) (.cse18 (= 0 ~z_val_t~0)) (.cse7 (<= ~z_val~0 0)) (.cse9 (<= 1 ~d0_val~0)) (.cse10 (<= 1 ~d0_val_t~0)) (.cse11 (<= ~b0_req_up~0 0)) (.cse12 (<= ~b1_req_up~0 0)) (.cse13 (<= 2 ~z_ev~0)) (.cse14 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-15 23:45:43,034 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-15 23:45:43,034 INFO L443 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-15 23:45:43,035 INFO L443 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-15 23:45:43,035 INFO L443 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-15 23:45:43,035 INFO L439 ceAbstractionStarter]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-15 23:45:43,035 INFO L443 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2019-11-15 23:45:43,035 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-11-15 23:45:43,036 INFO L443 ceAbstractionStarter]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-11-15 23:45:43,036 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-11-15 23:45:43,036 INFO L443 ceAbstractionStarter]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-11-15 23:45:43,036 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:45:43,036 INFO L443 ceAbstractionStarter]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-11-15 23:45:43,037 INFO L443 ceAbstractionStarter]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-11-15 23:45:43,037 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-15 23:45:43,037 INFO L446 ceAbstractionStarter]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-11-15 23:45:43,037 INFO L443 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,037 INFO L443 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,038 INFO L443 ceAbstractionStarter]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-11-15 23:45:43,038 INFO L443 ceAbstractionStarter]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-11-15 23:45:43,038 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-11-15 23:45:43,038 INFO L443 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-11-15 23:45:43,038 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-11-15 23:45:43,038 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-11-15 23:45:43,039 INFO L439 ceAbstractionStarter]: At program point L230(lines 245 249) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse11 (= ~b0_ev~0 0)) (.cse8 (= 0 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,039 INFO L439 ceAbstractionStarter]: At program point L230-1(lines 198 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-15 23:45:43,039 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:45:43,039 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-11-15 23:45:43,040 INFO L439 ceAbstractionStarter]: At program point L331-1(lines 307 339) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-15 23:45:43,040 INFO L439 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-15 23:45:43,040 INFO L439 ceAbstractionStarter]: At program point L364-3(lines 340 372) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-15 23:45:43,041 INFO L439 ceAbstractionStarter]: At program point L331-3(lines 307 339) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-15 23:45:43,041 INFO L439 ceAbstractionStarter]: At program point L265-1(lines 257 267) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-15 23:45:43,041 INFO L439 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-15 23:45:43,042 INFO L439 ceAbstractionStarter]: At program point L266-1(lines 254 268) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-15 23:45:43,042 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-11-15 23:45:43,042 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-11-15 23:45:43,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:45:43 BoogieIcfgContainer [2019-11-15 23:45:43,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:45:43,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:45:43,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:45:43,184 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:45:43,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:18" (3/4) ... [2019-11-15 23:45:43,193 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:45:43,230 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:45:43,231 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:45:43,431 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_25ab792e-a7ca-4579-85b0-a7ab081c3962/bin/uautomizer/witness.graphml [2019-11-15 23:45:43,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:45:43,433 INFO L168 Benchmark]: Toolchain (without parser) took 26505.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 507.5 MB). Free memory was 940.6 MB in the beginning and 901.1 MB in the end (delta: 39.5 MB). Peak memory consumption was 547.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,434 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:43,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,435 INFO L168 Benchmark]: Boogie Preprocessor took 81.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,435 INFO L168 Benchmark]: RCFGBuilder took 811.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,436 INFO L168 Benchmark]: TraceAbstraction took 24871.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 380.1 MB). Free memory was 1.1 GB in the beginning and 918.6 MB in the end (delta: 158.1 MB). Peak memory consumption was 623.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,436 INFO L168 Benchmark]: Witness Printer took 251.48 ms. Allocated memory is still 1.5 GB. Free memory was 918.6 MB in the beginning and 901.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:43,440 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 811.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24871.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 380.1 MB). Free memory was 1.1 GB in the beginning and 918.6 MB in the end (delta: 158.1 MB). Peak memory consumption was 623.1 MB. Max. memory is 11.5 GB. * Witness Printer took 251.48 ms. Allocated memory is still 1.5 GB. Free memory was 918.6 MB in the beginning and 901.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 == b0_req_up) && 1 <= d0_val_t) && 1 == b1_req_up) && 1 == d0_req_up) && 2 <= z_ev - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 1 == d0_req_up) && 2 <= z_ev) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 1 == d0_req_up) && 2 <= z_ev) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (z_val == 0 && b0_req_up <= 0) && b1_req_up <= 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: SAFE, OverallTime: 24.6s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.6s, HoareTripleCheckerStatistics: 4818 SDtfs, 2658 SDslu, 3080 SDs, 0 SdLazy, 294 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1628occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 2531 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5998 HoareAnnotationTreeSize, 33 FomulaSimplifications, 62407 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32509 FormulaSimplificationTreeSizeReductionInter, 15.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2277 NumberOfCodeBlocks, 2277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 343948 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 54/60 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...