./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 23:12:54,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:12:54,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:12:54,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:12:54,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:12:54,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:12:54,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:12:54,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:12:54,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:12:54,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:12:54,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:12:54,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:12:54,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:12:54,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:12:54,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:12:54,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:12:54,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:12:54,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:12:54,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:12:54,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:12:54,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:12:54,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:12:54,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:12:54,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:12:54,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:12:54,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:12:54,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:12:54,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:12:54,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:12:54,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:12:54,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:12:54,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:12:54,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:12:54,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:12:54,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:12:54,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:12:54,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:12:54,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:12:54,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:12:54,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:12:54,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:12:54,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:12:54,786 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:12:54,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:12:54,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:12:54,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:12:54,791 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:12:54,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:12:54,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:12:54,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:12:54,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:12:54,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:12:54,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:12:54,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:12:54,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:12:54,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:12:54,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:12:54,796 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:12:54,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:12:54,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:12:54,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:12:54,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:12:54,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:12:54,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:12:54,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:12:54,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:12:54,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:12:54,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:12:54,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:12:54,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:12:54,799 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:12:54,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2020-10-25 23:12:55,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:12:55,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:12:55,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:12:55,283 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:12:55,284 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:12:55,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-25 23:12:55,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3c73674/201d1863d6e74bfb9dd3696e7bd0fd6b/FLAGbc92074a2 [2020-10-25 23:12:56,089 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:12:56,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-25 23:12:56,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3c73674/201d1863d6e74bfb9dd3696e7bd0fd6b/FLAGbc92074a2 [2020-10-25 23:12:56,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3c73674/201d1863d6e74bfb9dd3696e7bd0fd6b [2020-10-25 23:12:56,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:12:56,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:12:56,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:12:56,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:12:56,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:12:56,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:56,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7552f071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56, skipping insertion in model container [2020-10-25 23:12:56,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:56,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:12:56,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:12:56,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:12:56,816 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:12:56,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:12:56,885 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:12:56,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56 WrapperNode [2020-10-25 23:12:56,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:12:56,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:12:56,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:12:56,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:12:56,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:56,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:56,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:12:56,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:12:56,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:12:56,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:12:56,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:56,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:57,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:57,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:57,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:57,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:57,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... [2020-10-25 23:12:57,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:12:57,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:12:57,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:12:57,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:12:57,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:12:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:12:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:12:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:12:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:12:58,011 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:12:58,013 INFO L298 CfgBuilder]: Removed 66 assume(true) statements. [2020-10-25 23:12:58,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:12:58 BoogieIcfgContainer [2020-10-25 23:12:58,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:12:58,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:12:58,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:12:58,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:12:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:12:56" (1/3) ... [2020-10-25 23:12:58,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b75807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:12:58, skipping insertion in model container [2020-10-25 23:12:58,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:56" (2/3) ... [2020-10-25 23:12:58,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b75807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:12:58, skipping insertion in model container [2020-10-25 23:12:58,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:12:58" (3/3) ... [2020-10-25 23:12:58,029 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2020-10-25 23:12:58,043 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:12:58,050 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:12:58,066 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:12:58,111 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:12:58,111 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:12:58,112 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:12:58,112 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:12:58,112 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:12:58,112 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:12:58,112 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:12:58,113 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:12:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2020-10-25 23:12:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 23:12:58,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:58,150 INFO L422 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] [2020-10-25 23:12:58,150 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2020-10-25 23:12:58,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:58,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504370421] [2020-10-25 23:12:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:58,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504370421] [2020-10-25 23:12:58,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:58,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:12:58,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198871172] [2020-10-25 23:12:58,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:12:58,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:12:58,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:12:58,497 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2020-10-25 23:12:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:58,558 INFO L93 Difference]: Finished difference Result 211 states and 353 transitions. [2020-10-25 23:12:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:58,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 23:12:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:58,584 INFO L225 Difference]: With dead ends: 211 [2020-10-25 23:12:58,585 INFO L226 Difference]: Without dead ends: 104 [2020-10-25 23:12:58,599 INFO L677 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 [2020-10-25 23:12:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-25 23:12:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-25 23:12:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-25 23:12:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2020-10-25 23:12:58,690 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2020-10-25 23:12:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:58,691 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2020-10-25 23:12:58,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:12:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2020-10-25 23:12:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-25 23:12:58,699 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:58,699 INFO L422 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] [2020-10-25 23:12:58,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:12:58,700 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:58,704 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2020-10-25 23:12:58,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:58,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843094699] [2020-10-25 23:12:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:58,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843094699] [2020-10-25 23:12:58,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:58,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:12:58,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201317992] [2020-10-25 23:12:58,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:12:58,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:12:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:12:58,881 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2020-10-25 23:12:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:58,911 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2020-10-25 23:12:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:58,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-10-25 23:12:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:58,914 INFO L225 Difference]: With dead ends: 199 [2020-10-25 23:12:58,914 INFO L226 Difference]: Without dead ends: 104 [2020-10-25 23:12:58,916 INFO L677 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 [2020-10-25 23:12:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-25 23:12:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-25 23:12:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-25 23:12:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2020-10-25 23:12:58,938 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2020-10-25 23:12:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:58,939 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2020-10-25 23:12:58,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:12:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2020-10-25 23:12:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-25 23:12:58,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:58,944 INFO L422 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] [2020-10-25 23:12:58,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:12:58,945 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2020-10-25 23:12:58,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:58,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572551178] [2020-10-25 23:12:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:59,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572551178] [2020-10-25 23:12:59,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:59,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:12:59,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803982662] [2020-10-25 23:12:59,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:12:59,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:12:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:12:59,052 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2020-10-25 23:12:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:59,077 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2020-10-25 23:12:59,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:59,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-10-25 23:12:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:59,079 INFO L225 Difference]: With dead ends: 196 [2020-10-25 23:12:59,080 INFO L226 Difference]: Without dead ends: 104 [2020-10-25 23:12:59,081 INFO L677 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 [2020-10-25 23:12:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-25 23:12:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-25 23:12:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-25 23:12:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2020-10-25 23:12:59,092 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2020-10-25 23:12:59,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:59,093 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2020-10-25 23:12:59,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:12:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2020-10-25 23:12:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-25 23:12:59,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:59,096 INFO L422 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] [2020-10-25 23:12:59,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:12:59,097 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2020-10-25 23:12:59,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:59,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986995792] [2020-10-25 23:12:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:59,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986995792] [2020-10-25 23:12:59,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:59,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:12:59,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440378653] [2020-10-25 23:12:59,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:12:59,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:59,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:12:59,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:12:59,167 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2020-10-25 23:12:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:59,194 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2020-10-25 23:12:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:59,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-10-25 23:12:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:59,197 INFO L225 Difference]: With dead ends: 193 [2020-10-25 23:12:59,197 INFO L226 Difference]: Without dead ends: 104 [2020-10-25 23:12:59,198 INFO L677 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 [2020-10-25 23:12:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-25 23:12:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-25 23:12:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-25 23:12:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2020-10-25 23:12:59,212 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2020-10-25 23:12:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:59,213 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2020-10-25 23:12:59,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:12:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2020-10-25 23:12:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-25 23:12:59,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:59,215 INFO L422 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] [2020-10-25 23:12:59,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:12:59,216 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2020-10-25 23:12:59,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:59,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315185931] [2020-10-25 23:12:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:59,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315185931] [2020-10-25 23:12:59,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:59,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:12:59,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331564799] [2020-10-25 23:12:59,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:12:59,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:12:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:12:59,302 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2020-10-25 23:12:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:59,355 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2020-10-25 23:12:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:59,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-10-25 23:12:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:59,358 INFO L225 Difference]: With dead ends: 271 [2020-10-25 23:12:59,358 INFO L226 Difference]: Without dead ends: 191 [2020-10-25 23:12:59,359 INFO L677 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 [2020-10-25 23:12:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-25 23:12:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2020-10-25 23:12:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-25 23:12:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2020-10-25 23:12:59,377 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2020-10-25 23:12:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:59,378 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2020-10-25 23:12:59,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:12:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2020-10-25 23:12:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-25 23:12:59,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:59,381 INFO L422 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] [2020-10-25 23:12:59,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:12:59,381 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2020-10-25 23:12:59,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:59,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590953957] [2020-10-25 23:12:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:59,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590953957] [2020-10-25 23:12:59,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:59,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 23:12:59,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343933171] [2020-10-25 23:12:59,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 23:12:59,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:59,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 23:12:59,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-25 23:12:59,467 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 6 states. [2020-10-25 23:12:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:59,587 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2020-10-25 23:12:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 23:12:59,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-10-25 23:12:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:59,590 INFO L225 Difference]: With dead ends: 444 [2020-10-25 23:12:59,590 INFO L226 Difference]: Without dead ends: 261 [2020-10-25 23:12:59,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:12:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-10-25 23:12:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2020-10-25 23:12:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-25 23:12:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2020-10-25 23:12:59,607 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2020-10-25 23:12:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:59,607 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2020-10-25 23:12:59,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 23:12:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2020-10-25 23:12:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-25 23:12:59,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:59,610 INFO L422 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] [2020-10-25 23:12:59,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:12:59,610 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:59,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2020-10-25 23:12:59,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:59,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998294592] [2020-10-25 23:12:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:59,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998294592] [2020-10-25 23:12:59,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:59,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:12:59,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865909657] [2020-10-25 23:12:59,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:12:59,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:12:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:12:59,701 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand 3 states. [2020-10-25 23:12:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:59,742 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2020-10-25 23:12:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:59,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-10-25 23:12:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:59,745 INFO L225 Difference]: With dead ends: 408 [2020-10-25 23:12:59,745 INFO L226 Difference]: Without dead ends: 271 [2020-10-25 23:12:59,746 INFO L677 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 [2020-10-25 23:12:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-25 23:12:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2020-10-25 23:12:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-25 23:12:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2020-10-25 23:12:59,760 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2020-10-25 23:12:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:59,760 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2020-10-25 23:12:59,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:12:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2020-10-25 23:12:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-25 23:12:59,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:59,763 INFO L422 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] [2020-10-25 23:12:59,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:12:59,763 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2020-10-25 23:12:59,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:59,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325121588] [2020-10-25 23:12:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:59,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325121588] [2020-10-25 23:12:59,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:59,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:12:59,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938536780] [2020-10-25 23:12:59,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:12:59,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:59,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:12:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:12:59,837 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand 5 states. [2020-10-25 23:12:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:59,918 INFO L93 Difference]: Finished difference Result 622 states and 975 transitions. [2020-10-25 23:12:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:12:59,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-10-25 23:12:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:59,922 INFO L225 Difference]: With dead ends: 622 [2020-10-25 23:12:59,922 INFO L226 Difference]: Without dead ends: 427 [2020-10-25 23:12:59,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:12:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-25 23:12:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 280. [2020-10-25 23:12:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-25 23:12:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2020-10-25 23:12:59,940 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2020-10-25 23:12:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:59,941 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2020-10-25 23:12:59,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:12:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2020-10-25 23:12:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-25 23:12:59,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:59,943 INFO L422 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] [2020-10-25 23:12:59,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:12:59,944 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2020-10-25 23:12:59,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:59,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141887572] [2020-10-25 23:12:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:00,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141887572] [2020-10-25 23:13:00,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:00,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:00,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485180950] [2020-10-25 23:13:00,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:00,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:00,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:00,026 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand 3 states. [2020-10-25 23:13:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:00,097 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2020-10-25 23:13:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:00,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-25 23:13:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:00,102 INFO L225 Difference]: With dead ends: 563 [2020-10-25 23:13:00,103 INFO L226 Difference]: Without dead ends: 332 [2020-10-25 23:13:00,105 INFO L677 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 [2020-10-25 23:13:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-25 23:13:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2020-10-25 23:13:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-25 23:13:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2020-10-25 23:13:00,123 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2020-10-25 23:13:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:00,124 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2020-10-25 23:13:00,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2020-10-25 23:13:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-25 23:13:00,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:00,126 INFO L422 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] [2020-10-25 23:13:00,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:13:00,131 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2020-10-25 23:13:00,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:00,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595668482] [2020-10-25 23:13:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:00,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595668482] [2020-10-25 23:13:00,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:00,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:00,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155084692] [2020-10-25 23:13:00,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:00,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:00,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:00,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:00,211 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand 3 states. [2020-10-25 23:13:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:00,250 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2020-10-25 23:13:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:00,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-25 23:13:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:00,268 INFO L225 Difference]: With dead ends: 567 [2020-10-25 23:13:00,269 INFO L226 Difference]: Without dead ends: 284 [2020-10-25 23:13:00,270 INFO L677 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 [2020-10-25 23:13:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-10-25 23:13:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-10-25 23:13:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-25 23:13:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2020-10-25 23:13:00,286 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2020-10-25 23:13:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:00,286 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2020-10-25 23:13:00,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2020-10-25 23:13:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-25 23:13:00,288 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:00,288 INFO L422 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] [2020-10-25 23:13:00,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:13:00,289 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2020-10-25 23:13:00,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:00,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12663576] [2020-10-25 23:13:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:00,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12663576] [2020-10-25 23:13:00,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:00,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:13:00,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501532707] [2020-10-25 23:13:00,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:13:00,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:13:00,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:00,388 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2020-10-25 23:13:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:00,440 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2020-10-25 23:13:00,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:13:00,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-10-25 23:13:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:00,445 INFO L225 Difference]: With dead ends: 811 [2020-10-25 23:13:00,446 INFO L226 Difference]: Without dead ends: 580 [2020-10-25 23:13:00,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-10-25 23:13:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2020-10-25 23:13:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-10-25 23:13:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2020-10-25 23:13:00,478 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2020-10-25 23:13:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:00,479 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2020-10-25 23:13:00,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:13:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2020-10-25 23:13:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-25 23:13:00,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:00,481 INFO L422 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] [2020-10-25 23:13:00,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:13:00,482 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2020-10-25 23:13:00,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:00,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934825414] [2020-10-25 23:13:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:00,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934825414] [2020-10-25 23:13:00,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:00,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:13:00,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160358396] [2020-10-25 23:13:00,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:13:00,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:13:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:00,579 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand 5 states. [2020-10-25 23:13:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:00,651 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2020-10-25 23:13:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:13:00,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-10-25 23:13:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:00,655 INFO L225 Difference]: With dead ends: 1097 [2020-10-25 23:13:00,655 INFO L226 Difference]: Without dead ends: 574 [2020-10-25 23:13:00,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:13:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-10-25 23:13:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2020-10-25 23:13:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-10-25 23:13:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2020-10-25 23:13:00,689 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2020-10-25 23:13:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:00,689 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2020-10-25 23:13:00,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:13:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2020-10-25 23:13:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-25 23:13:00,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:00,691 INFO L422 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] [2020-10-25 23:13:00,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:13:00,691 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:00,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:00,692 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2020-10-25 23:13:00,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:00,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083597803] [2020-10-25 23:13:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:00,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083597803] [2020-10-25 23:13:00,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:00,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:00,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977877834] [2020-10-25 23:13:00,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:00,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:00,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:00,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:00,740 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand 3 states. [2020-10-25 23:13:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:00,814 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2020-10-25 23:13:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:00,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-10-25 23:13:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:00,820 INFO L225 Difference]: With dead ends: 1592 [2020-10-25 23:13:00,821 INFO L226 Difference]: Without dead ends: 1069 [2020-10-25 23:13:00,822 INFO L677 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 [2020-10-25 23:13:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2020-10-25 23:13:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2020-10-25 23:13:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-10-25 23:13:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2020-10-25 23:13:00,873 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2020-10-25 23:13:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:00,873 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2020-10-25 23:13:00,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2020-10-25 23:13:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-25 23:13:00,875 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:00,876 INFO L422 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] [2020-10-25 23:13:00,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:13:00,876 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2020-10-25 23:13:00,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:00,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893249145] [2020-10-25 23:13:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:00,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893249145] [2020-10-25 23:13:00,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:00,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:13:00,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614263197] [2020-10-25 23:13:00,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:13:00,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:13:00,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:00,970 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand 5 states. [2020-10-25 23:13:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:01,087 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2020-10-25 23:13:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:13:01,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-10-25 23:13:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:01,092 INFO L225 Difference]: With dead ends: 1105 [2020-10-25 23:13:01,093 INFO L226 Difference]: Without dead ends: 570 [2020-10-25 23:13:01,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:13:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-10-25 23:13:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-10-25 23:13:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-10-25 23:13:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2020-10-25 23:13:01,151 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2020-10-25 23:13:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:01,151 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2020-10-25 23:13:01,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:13:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2020-10-25 23:13:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-25 23:13:01,153 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:01,153 INFO L422 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] [2020-10-25 23:13:01,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:13:01,154 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2020-10-25 23:13:01,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:01,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978336329] [2020-10-25 23:13:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:01,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978336329] [2020-10-25 23:13:01,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:01,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:01,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783908786] [2020-10-25 23:13:01,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:01,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:01,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:01,202 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand 3 states. [2020-10-25 23:13:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:01,307 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2020-10-25 23:13:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:01,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-10-25 23:13:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:01,314 INFO L225 Difference]: With dead ends: 1592 [2020-10-25 23:13:01,315 INFO L226 Difference]: Without dead ends: 1073 [2020-10-25 23:13:01,317 INFO L677 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 [2020-10-25 23:13:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2020-10-25 23:13:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2020-10-25 23:13:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-10-25 23:13:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2020-10-25 23:13:01,373 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2020-10-25 23:13:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:01,374 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2020-10-25 23:13:01,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2020-10-25 23:13:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-25 23:13:01,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:01,376 INFO L422 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] [2020-10-25 23:13:01,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:13:01,377 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2020-10-25 23:13:01,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:01,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130789033] [2020-10-25 23:13:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:01,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130789033] [2020-10-25 23:13:01,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:01,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:01,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21893684] [2020-10-25 23:13:01,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:01,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:01,417 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand 3 states. [2020-10-25 23:13:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:01,502 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2020-10-25 23:13:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:01,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-10-25 23:13:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:01,507 INFO L225 Difference]: With dead ends: 1311 [2020-10-25 23:13:01,507 INFO L226 Difference]: Without dead ends: 784 [2020-10-25 23:13:01,508 INFO L677 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 [2020-10-25 23:13:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-10-25 23:13:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2020-10-25 23:13:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-10-25 23:13:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2020-10-25 23:13:01,569 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2020-10-25 23:13:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:01,570 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2020-10-25 23:13:01,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2020-10-25 23:13:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-25 23:13:01,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:01,572 INFO L422 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] [2020-10-25 23:13:01,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:13:01,572 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2020-10-25 23:13:01,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:01,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061788276] [2020-10-25 23:13:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:01,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061788276] [2020-10-25 23:13:01,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249581722] [2020-10-25 23:13:01,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:13:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:01,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 23:13:01,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:13:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:01,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:13:01,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-25 23:13:01,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661265735] [2020-10-25 23:13:01,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:01,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:01,937 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand 3 states. [2020-10-25 23:13:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:02,022 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2020-10-25 23:13:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:02,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-10-25 23:13:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:02,027 INFO L225 Difference]: With dead ends: 1341 [2020-10-25 23:13:02,027 INFO L226 Difference]: Without dead ends: 686 [2020-10-25 23:13:02,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-10-25 23:13:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2020-10-25 23:13:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-10-25 23:13:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2020-10-25 23:13:02,098 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2020-10-25 23:13:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:02,098 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2020-10-25 23:13:02,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2020-10-25 23:13:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-25 23:13:02,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:02,100 INFO L422 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] [2020-10-25 23:13:02,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-25 23:13:02,315 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2020-10-25 23:13:02,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:02,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210940655] [2020-10-25 23:13:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:02,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210940655] [2020-10-25 23:13:02,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217387234] [2020-10-25 23:13:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:13:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:02,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 23:13:02,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:13:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:02,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:13:02,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-25 23:13:02,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950384992] [2020-10-25 23:13:02,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:02,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:02,585 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand 3 states. [2020-10-25 23:13:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:02,742 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2020-10-25 23:13:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:02,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-25 23:13:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:02,750 INFO L225 Difference]: With dead ends: 2025 [2020-10-25 23:13:02,750 INFO L226 Difference]: Without dead ends: 1364 [2020-10-25 23:13:02,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-10-25 23:13:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2020-10-25 23:13:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2020-10-25 23:13:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2020-10-25 23:13:02,880 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2020-10-25 23:13:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:02,880 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2020-10-25 23:13:02,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2020-10-25 23:13:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-25 23:13:02,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:02,884 INFO L422 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] [2020-10-25 23:13:03,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-25 23:13:03,100 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2020-10-25 23:13:03,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:03,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400283547] [2020-10-25 23:13:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:03,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400283547] [2020-10-25 23:13:03,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:03,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:03,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105547413] [2020-10-25 23:13:03,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:03,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:03,132 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand 3 states. [2020-10-25 23:13:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:03,276 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2020-10-25 23:13:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:03,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-25 23:13:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:03,285 INFO L225 Difference]: With dead ends: 2736 [2020-10-25 23:13:03,285 INFO L226 Difference]: Without dead ends: 1463 [2020-10-25 23:13:03,288 INFO L677 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 [2020-10-25 23:13:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-10-25 23:13:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2020-10-25 23:13:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2020-10-25 23:13:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2020-10-25 23:13:03,404 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2020-10-25 23:13:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:03,405 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2020-10-25 23:13:03,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2020-10-25 23:13:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-25 23:13:03,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:03,408 INFO L422 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] [2020-10-25 23:13:03,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:13:03,408 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2020-10-25 23:13:03,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:03,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785860985] [2020-10-25 23:13:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:03,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785860985] [2020-10-25 23:13:03,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:03,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:03,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643319938] [2020-10-25 23:13:03,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:03,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:03,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:03,455 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand 3 states. [2020-10-25 23:13:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:03,549 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2020-10-25 23:13:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:03,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-25 23:13:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:03,554 INFO L225 Difference]: With dead ends: 2354 [2020-10-25 23:13:03,554 INFO L226 Difference]: Without dead ends: 973 [2020-10-25 23:13:03,557 INFO L677 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 [2020-10-25 23:13:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-10-25 23:13:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2020-10-25 23:13:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2020-10-25 23:13:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2020-10-25 23:13:03,638 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2020-10-25 23:13:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:03,638 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2020-10-25 23:13:03,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2020-10-25 23:13:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:13:03,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:03,640 INFO L422 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] [2020-10-25 23:13:03,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 23:13:03,641 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:03,641 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2020-10-25 23:13:03,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:03,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588735760] [2020-10-25 23:13:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:03,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588735760] [2020-10-25 23:13:03,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:03,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:13:03,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158572098] [2020-10-25 23:13:03,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:13:03,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:13:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:03,696 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand 4 states. [2020-10-25 23:13:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:03,742 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2020-10-25 23:13:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:13:03,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-10-25 23:13:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:03,745 INFO L225 Difference]: With dead ends: 1258 [2020-10-25 23:13:03,746 INFO L226 Difference]: Without dead ends: 373 [2020-10-25 23:13:03,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-10-25 23:13:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-10-25 23:13:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-25 23:13:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2020-10-25 23:13:03,774 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2020-10-25 23:13:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:03,775 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2020-10-25 23:13:03,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:13:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2020-10-25 23:13:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:13:03,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:03,777 INFO L422 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] [2020-10-25 23:13:03,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 23:13:03,777 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2020-10-25 23:13:03,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:03,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804957976] [2020-10-25 23:13:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:03,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804957976] [2020-10-25 23:13:03,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592118715] [2020-10-25 23:13:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:13:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:03,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 23:13:03,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:13:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:03,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:13:03,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-25 23:13:03,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693901192] [2020-10-25 23:13:03,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:03,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:03,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:03,984 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 3 states. [2020-10-25 23:13:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:04,111 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2020-10-25 23:13:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:04,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-25 23:13:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:04,116 INFO L225 Difference]: With dead ends: 1059 [2020-10-25 23:13:04,116 INFO L226 Difference]: Without dead ends: 732 [2020-10-25 23:13:04,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-25 23:13:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2020-10-25 23:13:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2020-10-25 23:13:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2020-10-25 23:13:04,177 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2020-10-25 23:13:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:04,178 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2020-10-25 23:13:04,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2020-10-25 23:13:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:13:04,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:04,181 INFO L422 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] [2020-10-25 23:13:04,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-10-25 23:13:04,396 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2020-10-25 23:13:04,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:04,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774903606] [2020-10-25 23:13:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:04,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774903606] [2020-10-25 23:13:04,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:04,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:04,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285126744] [2020-10-25 23:13:04,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:04,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:04,427 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand 3 states. [2020-10-25 23:13:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:04,515 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2020-10-25 23:13:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:04,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-25 23:13:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:04,520 INFO L225 Difference]: With dead ends: 1382 [2020-10-25 23:13:04,520 INFO L226 Difference]: Without dead ends: 811 [2020-10-25 23:13:04,521 INFO L677 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 [2020-10-25 23:13:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-10-25 23:13:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2020-10-25 23:13:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-10-25 23:13:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2020-10-25 23:13:04,580 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2020-10-25 23:13:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:04,581 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2020-10-25 23:13:04,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2020-10-25 23:13:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 23:13:04,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:04,583 INFO L422 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] [2020-10-25 23:13:04,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 23:13:04,584 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2020-10-25 23:13:04,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:04,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243747741] [2020-10-25 23:13:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:04,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243747741] [2020-10-25 23:13:04,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:04,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:13:04,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961922585] [2020-10-25 23:13:04,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:04,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:13:04,616 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand 3 states. [2020-10-25 23:13:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:04,676 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2020-10-25 23:13:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:04,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-25 23:13:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:04,680 INFO L225 Difference]: With dead ends: 1208 [2020-10-25 23:13:04,680 INFO L226 Difference]: Without dead ends: 551 [2020-10-25 23:13:04,681 INFO L677 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 [2020-10-25 23:13:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-10-25 23:13:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2020-10-25 23:13:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-10-25 23:13:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2020-10-25 23:13:04,720 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2020-10-25 23:13:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:04,720 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2020-10-25 23:13:04,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2020-10-25 23:13:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-25 23:13:04,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:04,722 INFO L422 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] [2020-10-25 23:13:04,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 23:13:04,722 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2020-10-25 23:13:04,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:04,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421563176] [2020-10-25 23:13:04,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:04,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421563176] [2020-10-25 23:13:04,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:04,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:13:04,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275733834] [2020-10-25 23:13:04,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:13:04,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:13:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:04,771 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand 4 states. [2020-10-25 23:13:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:04,815 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2020-10-25 23:13:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:13:04,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-25 23:13:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:04,818 INFO L225 Difference]: With dead ends: 820 [2020-10-25 23:13:04,818 INFO L226 Difference]: Without dead ends: 427 [2020-10-25 23:13:04,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-25 23:13:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-10-25 23:13:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-25 23:13:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2020-10-25 23:13:04,860 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2020-10-25 23:13:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:04,860 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2020-10-25 23:13:04,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:13:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2020-10-25 23:13:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-25 23:13:04,861 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:04,862 INFO L422 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] [2020-10-25 23:13:04,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 23:13:04,862 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2020-10-25 23:13:04,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:04,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104880143] [2020-10-25 23:13:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:04,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104880143] [2020-10-25 23:13:04,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558889274] [2020-10-25 23:13:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:13:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:05,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 23:13:05,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:13:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:13:05,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:13:05,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-25 23:13:05,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925698488] [2020-10-25 23:13:05,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:13:05,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:13:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:05,057 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand 3 states. [2020-10-25 23:13:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:05,145 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2020-10-25 23:13:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:13:05,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-10-25 23:13:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:05,150 INFO L225 Difference]: With dead ends: 1163 [2020-10-25 23:13:05,150 INFO L226 Difference]: Without dead ends: 822 [2020-10-25 23:13:05,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-10-25 23:13:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2020-10-25 23:13:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-25 23:13:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2020-10-25 23:13:05,213 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2020-10-25 23:13:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:05,213 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2020-10-25 23:13:05,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:13:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2020-10-25 23:13:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-25 23:13:05,216 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:05,216 INFO L422 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] [2020-10-25 23:13:05,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:13:05,430 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2020-10-25 23:13:05,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:05,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935146428] [2020-10-25 23:13:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:05,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935146428] [2020-10-25 23:13:05,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981537996] [2020-10-25 23:13:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:13:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:05,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-25 23:13:05,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:13:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:05,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:13:05,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-10-25 23:13:05,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102011604] [2020-10-25 23:13:05,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:13:05,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:05,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:13:05,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:05,660 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand 4 states. [2020-10-25 23:13:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:05,764 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2020-10-25 23:13:05,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:13:05,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-25 23:13:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:05,769 INFO L225 Difference]: With dead ends: 1704 [2020-10-25 23:13:05,769 INFO L226 Difference]: Without dead ends: 1054 [2020-10-25 23:13:05,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2020-10-25 23:13:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2020-10-25 23:13:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-10-25 23:13:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2020-10-25 23:13:05,853 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2020-10-25 23:13:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:05,853 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2020-10-25 23:13:05,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:13:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2020-10-25 23:13:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-25 23:13:05,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:05,867 INFO L422 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] [2020-10-25 23:13:06,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-25 23:13:06,083 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2020-10-25 23:13:06,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:06,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684837851] [2020-10-25 23:13:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:06,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684837851] [2020-10-25 23:13:06,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:06,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:13:06,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864583759] [2020-10-25 23:13:06,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:13:06,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:13:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:06,135 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand 4 states. [2020-10-25 23:13:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:06,301 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2020-10-25 23:13:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:13:06,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-25 23:13:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:06,310 INFO L225 Difference]: With dead ends: 2540 [2020-10-25 23:13:06,310 INFO L226 Difference]: Without dead ends: 1698 [2020-10-25 23:13:06,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:13:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2020-10-25 23:13:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2020-10-25 23:13:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2020-10-25 23:13:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2020-10-25 23:13:06,406 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2020-10-25 23:13:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:06,406 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2020-10-25 23:13:06,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:13:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2020-10-25 23:13:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-25 23:13:06,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:13:06,408 INFO L422 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] [2020-10-25 23:13:06,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 23:13:06,408 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:13:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:13:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2020-10-25 23:13:06,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:13:06,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189896935] [2020-10-25 23:13:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:13:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:13:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:13:06,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189896935] [2020-10-25 23:13:06,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:13:06,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:13:06,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167830672] [2020-10-25 23:13:06,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:13:06,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:13:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:13:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:13:06,471 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand 5 states. [2020-10-25 23:13:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:13:06,570 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2020-10-25 23:13:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:13:06,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-25 23:13:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:13:06,571 INFO L225 Difference]: With dead ends: 1285 [2020-10-25 23:13:06,571 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 23:13:06,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:13:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 23:13:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 23:13:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 23:13:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 23:13:06,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2020-10-25 23:13:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:13:06,573 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 23:13:06,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:13:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 23:13:06,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 23:13:06,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 23:13:06,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 23:13:07,658 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-25 23:13:07,867 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-25 23:13:08,110 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-10-25 23:13:08,307 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-10-25 23:13:08,479 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-25 23:13:08,674 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-10-25 23:13:08,881 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-25 23:13:09,087 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-25 23:13:09,228 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-25 23:13:09,591 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2020-10-25 23:13:09,807 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-25 23:13:09,920 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-25 23:13:10,128 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-25 23:13:10,317 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-25 23:13:10,578 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-25 23:13:10,720 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-10-25 23:13:10,851 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-25 23:13:10,968 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-25 23:13:11,188 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-10-25 23:13:11,447 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-10-25 23:13:11,584 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-10-25 23:13:11,810 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-10-25 23:13:12,131 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2020-10-25 23:13:12,315 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-25 23:13:12,500 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-25 23:13:12,725 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-10-25 23:13:12,918 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-25 23:13:13,140 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-10-25 23:13:13,146 INFO L274 CegarLoopResult]: For program point L399(lines 399 404) no Hoare annotation was computed. [2020-10-25 23:13:13,147 INFO L270 CegarLoopResult]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse6 (<= 2 ~b1_ev~0)) (.cse0 (= ~d0_ev~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse16 (= ~b1_ev~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse15 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14))) [2020-10-25 23:13:13,147 INFO L270 CegarLoopResult]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2020-10-25 23:13:13,147 INFO L270 CegarLoopResult]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,148 INFO L270 CegarLoopResult]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,148 INFO L270 CegarLoopResult]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,148 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 23:13:13,148 INFO L270 CegarLoopResult]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2020-10-25 23:13:13,149 INFO L270 CegarLoopResult]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,149 INFO L274 CegarLoopResult]: For program point L103(lines 103 118) no Hoare annotation was computed. [2020-10-25 23:13:13,149 INFO L274 CegarLoopResult]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2020-10-25 23:13:13,149 INFO L274 CegarLoopResult]: For program point L71(lines 43 93) no Hoare annotation was computed. [2020-10-25 23:13:13,149 INFO L277 CegarLoopResult]: At program point L501(lines 485 503) the Hoare annotation is: true [2020-10-25 23:13:13,149 INFO L270 CegarLoopResult]: At program point L303(lines 271 308) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,149 INFO L274 CegarLoopResult]: For program point L204(lines 204 210) no Hoare annotation was computed. [2020-10-25 23:13:13,149 INFO L270 CegarLoopResult]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0) (not (= ~d1_val_t~0 0)) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (<= 2 ~d1_ev~0)) [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L270 CegarLoopResult]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L72(lines 72 76) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L107(lines 107 117) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L174(lines 174 179) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2020-10-25 23:13:13,150 INFO L274 CegarLoopResult]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2020-10-25 23:13:13,151 INFO L270 CegarLoopResult]: At program point L406(lines 395 408) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,151 INFO L270 CegarLoopResult]: At program point L407(lines 391 409) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,151 INFO L274 CegarLoopResult]: For program point L44(lines 44 52) no Hoare annotation was computed. [2020-10-25 23:13:13,151 INFO L274 CegarLoopResult]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2020-10-25 23:13:13,151 INFO L274 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-10-25 23:13:13,151 INFO L274 CegarLoopResult]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-10-25 23:13:13,151 INFO L274 CegarLoopResult]: For program point L144(lines 144 149) no Hoare annotation was computed. [2020-10-25 23:13:13,151 INFO L274 CegarLoopResult]: For program point L111(lines 111 116) no Hoare annotation was computed. [2020-10-25 23:13:13,152 INFO L274 CegarLoopResult]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2020-10-25 23:13:13,152 INFO L274 CegarLoopResult]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2020-10-25 23:13:13,152 INFO L274 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-10-25 23:13:13,152 INFO L274 CegarLoopResult]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2020-10-25 23:13:13,152 INFO L274 CegarLoopResult]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2020-10-25 23:13:13,152 INFO L270 CegarLoopResult]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d0_val_t~0 0))) (.cse1 (= ~z_ev~0 2)) (.cse2 (= ~z_val~0 0)) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (= ~d1_req_up~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= ~d0_req_up~0 1)) (.cse14 (= 0 ~z_val_t~0)) (.cse15 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~b1_ev~0 0) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b1_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-10-25 23:13:13,152 INFO L270 CegarLoopResult]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L278(line 278) no Hoare annotation was computed. [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,153 INFO L270 CegarLoopResult]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse7 (= ~d0_ev~0 0)) (.cse13 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (not (= ~b1_val~0 0))) (.cse15 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_req_up~0 1))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse9 (not (= 1 ~b1_req_up~0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse14))) [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,153 INFO L274 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-10-25 23:13:13,154 INFO L274 CegarLoopResult]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2020-10-25 23:13:13,154 INFO L270 CegarLoopResult]: At program point L447(lines 493 499) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~b1_val_t~0 0)) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (not (= 1 ~b1_req_up~0)) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_req_up~0 1))) [2020-10-25 23:13:13,154 INFO L274 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-10-25 23:13:13,154 INFO L274 CegarLoopResult]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2020-10-25 23:13:13,154 INFO L274 CegarLoopResult]: For program point L382(lines 382 386) no Hoare annotation was computed. [2020-10-25 23:13:13,154 INFO L270 CegarLoopResult]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse11 (<= 2 ~d0_ev~0)) (.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2020-10-25 23:13:13,154 INFO L274 CegarLoopResult]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2020-10-25 23:13:13,155 INFO L270 CegarLoopResult]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,155 INFO L270 CegarLoopResult]: At program point L482(lines 453 484) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~b1_ev~0) (= ~b0_val_t~0 1) (<= 2 ~d0_ev~0) (= ~b0_val~0 0) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~b0_req_up~0 1) (<= 2 ~d1_ev~0)) [2020-10-25 23:13:13,155 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 23:13:13,155 INFO L270 CegarLoopResult]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse9 (= ~d0_ev~0 0)) (.cse14 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (= ~d1_req_up~0 1)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse15 .cse16))) [2020-10-25 23:13:13,156 INFO L270 CegarLoopResult]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,156 INFO L274 CegarLoopResult]: For program point L53(lines 43 93) no Hoare annotation was computed. [2020-10-25 23:13:13,156 INFO L274 CegarLoopResult]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,156 INFO L274 CegarLoopResult]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,156 INFO L274 CegarLoopResult]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,156 INFO L274 CegarLoopResult]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,156 INFO L274 CegarLoopResult]: For program point L54(lines 54 58) no Hoare annotation was computed. [2020-10-25 23:13:13,156 INFO L270 CegarLoopResult]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse11 (<= 2 ~d0_ev~0)) (.cse16 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2020-10-25 23:13:13,157 INFO L270 CegarLoopResult]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,157 INFO L270 CegarLoopResult]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,160 INFO L270 CegarLoopResult]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse18 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (<= 2 ~d0_ev~0)) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (= |ULTIMATE.start_is_method1_triggered_#res| 1)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (not (= ~d1_val_t~0 0))) (.cse16 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2020-10-25 23:13:13,160 INFO L270 CegarLoopResult]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_is_method1_triggered_#res| 1) .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,160 INFO L274 CegarLoopResult]: For program point L189(lines 189 194) no Hoare annotation was computed. [2020-10-25 23:13:13,160 INFO L274 CegarLoopResult]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2020-10-25 23:13:13,161 INFO L274 CegarLoopResult]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2020-10-25 23:13:13,161 INFO L274 CegarLoopResult]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2020-10-25 23:13:13,161 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 23:13:13,161 INFO L274 CegarLoopResult]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,161 INFO L274 CegarLoopResult]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,161 INFO L274 CegarLoopResult]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,162 INFO L274 CegarLoopResult]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,162 INFO L274 CegarLoopResult]: For program point L291(lines 291 298) no Hoare annotation was computed. [2020-10-25 23:13:13,162 INFO L270 CegarLoopResult]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-10-25 23:13:13,163 INFO L270 CegarLoopResult]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,163 INFO L274 CegarLoopResult]: For program point L159(lines 159 164) no Hoare annotation was computed. [2020-10-25 23:13:13,163 INFO L274 CegarLoopResult]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2020-10-25 23:13:13,163 INFO L274 CegarLoopResult]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2020-10-25 23:13:13,164 INFO L274 CegarLoopResult]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2020-10-25 23:13:13,164 INFO L270 CegarLoopResult]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-10-25 23:13:13,164 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 23:13:13,164 INFO L274 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2020-10-25 23:13:13,165 INFO L274 CegarLoopResult]: For program point L260(lines 260 265) no Hoare annotation was computed. [2020-10-25 23:13:13,165 INFO L274 CegarLoopResult]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2020-10-25 23:13:13,165 INFO L274 CegarLoopResult]: For program point L129(lines 129 134) no Hoare annotation was computed. [2020-10-25 23:13:13,165 INFO L274 CegarLoopResult]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2020-10-25 23:13:13,166 INFO L274 CegarLoopResult]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2020-10-25 23:13:13,166 INFO L274 CegarLoopResult]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2020-10-25 23:13:13,166 INFO L277 CegarLoopResult]: At program point L493(lines 493 499) the Hoare annotation is: true [2020-10-25 23:13:13,167 INFO L274 CegarLoopResult]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,167 INFO L274 CegarLoopResult]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,167 INFO L274 CegarLoopResult]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2020-10-25 23:13:13,167 INFO L274 CegarLoopResult]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2020-10-25 23:13:13,167 INFO L274 CegarLoopResult]: For program point L65(lines 65 69) no Hoare annotation was computed. [2020-10-25 23:13:13,167 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 23:13:13,169 INFO L274 CegarLoopResult]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2020-10-25 23:13:13,169 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 23:13:13,170 INFO L274 CegarLoopResult]: For program point L99(lines 99 119) no Hoare annotation was computed. [2020-10-25 23:13:13,170 INFO L274 CegarLoopResult]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2020-10-25 23:13:13,171 INFO L270 CegarLoopResult]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-10-25 23:13:13,171 INFO L270 CegarLoopResult]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-25 23:13:13,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:13:13 BoogieIcfgContainer [2020-10-25 23:13:13,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:13:13,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:13:13,274 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:13:13,274 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:13:13,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:12:58" (3/4) ... [2020-10-25 23:13:13,279 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 23:13:13,303 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 23:13:13,304 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 23:13:13,304 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 23:13:13,305 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 23:13:13,339 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2020-10-25 23:13:13,341 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) [2020-10-25 23:13:13,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2020-10-25 23:13:13,432 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:13:13,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:13:13,434 INFO L168 Benchmark]: Toolchain (without parser) took 16999.72 ms. Allocated memory was 48.2 MB in the beginning and 339.7 MB in the end (delta: 291.5 MB). Free memory was 25.9 MB in the beginning and 150.5 MB in the end (delta: -124.6 MB). Peak memory consumption was 168.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,434 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 35.7 MB. Free memory was 18.1 MB in the beginning and 18.1 MB in the end (delta: 31.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:13:13,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.33 ms. Allocated memory is still 48.2 MB. Free memory was 25.3 MB in the beginning and 23.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.40 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 32.9 MB in the end (delta: -9.4 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,436 INFO L168 Benchmark]: Boogie Preprocessor took 42.48 ms. Allocated memory is still 48.2 MB. Free memory was 32.9 MB in the beginning and 31.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,436 INFO L168 Benchmark]: RCFGBuilder took 990.15 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 31.0 MB in the beginning and 34.2 MB in the end (delta: -3.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,436 INFO L168 Benchmark]: TraceAbstraction took 15254.36 ms. Allocated memory was 58.7 MB in the beginning and 339.7 MB in the end (delta: 281.0 MB). Free memory was 33.9 MB in the beginning and 161.0 MB in the end (delta: -127.1 MB). Peak memory consumption was 200.0 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,437 INFO L168 Benchmark]: Witness Printer took 159.15 ms. Allocated memory is still 339.7 MB. Free memory was 161.0 MB in the beginning and 150.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:13:13,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 35.7 MB. Free memory was 18.1 MB in the beginning and 18.1 MB in the end (delta: 31.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 440.33 ms. Allocated memory is still 48.2 MB. Free memory was 25.3 MB in the beginning and 23.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.40 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 32.9 MB in the end (delta: -9.4 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.48 ms. Allocated memory is still 48.2 MB. Free memory was 32.9 MB in the beginning and 31.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 990.15 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 31.0 MB in the beginning and 34.2 MB in the end (delta: -3.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15254.36 ms. Allocated memory was 58.7 MB in the beginning and 339.7 MB in the end (delta: 281.0 MB). Free memory was 33.9 MB in the beginning and 161.0 MB in the end (delta: -127.1 MB). Peak memory consumption was 200.0 MB. Max. memory is 16.1 GB. * Witness Printer took 159.15 ms. Allocated memory is still 339.7 MB. Free memory was 161.0 MB in the beginning and 150.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 271]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && d1_val_t == b0_val_t) && 2 <= b1_ev) && b0_val_t == 1) && 2 <= d0_ev) && b0_val == 0) && 1 == b1_req_up) && b1_val_t == b0_val_t) && d0_req_up == 1) && 0 == z_val_t) && d0_val_t == b0_val_t) && b0_req_up == 1) && 2 <= d1_ev - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((2 <= b0_ev && !(b1_val_t == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && !(1 == b1_req_up)) && z_val == 0) && !(b1_val == 0)) && 0 == z_val_t) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && b0_ev == 0) && 1 == b1_req_up) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.4s, OverallIterations: 29, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4787 SDtfs, 2705 SDslu, 5016 SDs, 0 SdLazy, 402 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 2015 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3750 HoareAnnotationTreeSize, 33 FomulaSimplifications, 39368 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14097 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 458837 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...