./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 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G --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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:43:57,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:43:57,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:43:57,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:43:57,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:43:57,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:43:57,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:43:57,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:43:57,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:43:57,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:43:57,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:43:57,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:43:57,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:43:57,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:43:57,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:43:57,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:43:57,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:43:57,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:43:57,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:43:57,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:43:57,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:43:57,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:43:57,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:43:57,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:43:57,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:43:57,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:43:57,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:43:57,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:43:57,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:43:57,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:43:57,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:43:57,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:43:57,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:43:57,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:43:57,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:43:57,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:43:57,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:43:57,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:43:57,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:43:57,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:43:57,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:43:57,698 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:43:57,738 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:43:57,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:43:57,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:43:57,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:43:57,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:43:57,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:43:57,754 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:43:57,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:43:57,754 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:43:57,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:43:57,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:43:57,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:43:57,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:43:57,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:43:57,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:43:57,757 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:43:57,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:43:57,758 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:43:57,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:43:57,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:43:57,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:43:57,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:43:57,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:43:57,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:43:57,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:43:57,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:43:57,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:43:57,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:43:57,761 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:43:57,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:43:57,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:43:57,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:43:57,764 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2021-11-23 13:43:58,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:43:58,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:43:58,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:43:58,059 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:43:58,060 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:43:58,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-23 13:43:58,147 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/data/d8a9615f6/d56e6c38c62942cd8197b28a3bf51900/FLAG5d42ef59c [2021-11-23 13:43:58,639 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:43:58,639 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-23 13:43:58,651 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/data/d8a9615f6/d56e6c38c62942cd8197b28a3bf51900/FLAG5d42ef59c [2021-11-23 13:43:59,014 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/data/d8a9615f6/d56e6c38c62942cd8197b28a3bf51900 [2021-11-23 13:43:59,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:43:59,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:43:59,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:43:59,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:43:59,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:43:59,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428ce67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59, skipping insertion in model container [2021-11-23 13:43:59,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:43:59,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:43:59,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-23 13:43:59,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:43:59,342 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:43:59,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-23 13:43:59,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:43:59,419 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:43:59,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59 WrapperNode [2021-11-23 13:43:59,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:43:59,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:43:59,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:43:59,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:43:59,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,471 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 25, calls inlined = 31, statements flattened = 350 [2021-11-23 13:43:59,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:43:59,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:43:59,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:43:59,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:43:59,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:43:59,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:43:59,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:43:59,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:43:59,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (1/1) ... [2021-11-23 13:43:59,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:43:59,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:43:59,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:43:59,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:43:59,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:43:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:43:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:43:59,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:43:59,667 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:43:59,668 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:44:00,108 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:44:00,117 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:44:00,117 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-23 13:44:00,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:44:00 BoogieIcfgContainer [2021-11-23 13:44:00,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:44:00,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:44:00,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:44:00,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:44:00,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:43:59" (1/3) ... [2021-11-23 13:44:00,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a9e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:44:00, skipping insertion in model container [2021-11-23 13:44:00,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:59" (2/3) ... [2021-11-23 13:44:00,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a9e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:44:00, skipping insertion in model container [2021-11-23 13:44:00,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:44:00" (3/3) ... [2021-11-23 13:44:00,128 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-11-23 13:44:00,138 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:44:00,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 13:44:00,191 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:44:00,200 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 13:44:00,201 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 13:44:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.596774193548387) internal successors, (198), 125 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 13:44:00,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:00,233 INFO L514 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] [2021-11-23 13:44:00,234 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1945267885, now seen corresponding path program 1 times [2021-11-23 13:44:00,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:00,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44086214] [2021-11-23 13:44:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:00,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:00,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:00,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44086214] [2021-11-23 13:44:00,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44086214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:00,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:00,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:00,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554208822] [2021-11-23 13:44:00,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:00,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:00,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:00,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:00,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:00,525 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.596774193548387) internal successors, (198), 125 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:00,611 INFO L93 Difference]: Finished difference Result 244 states and 386 transitions. [2021-11-23 13:44:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-23 13:44:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:00,628 INFO L225 Difference]: With dead ends: 244 [2021-11-23 13:44:00,629 INFO L226 Difference]: Without dead ends: 121 [2021-11-23 13:44:00,633 INFO L932 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 [2021-11-23 13:44:00,638 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:00,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 369 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-23 13:44:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-23 13:44:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2021-11-23 13:44:00,713 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 32 [2021-11-23 13:44:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:00,714 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2021-11-23 13:44:00,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2021-11-23 13:44:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 13:44:00,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:00,724 INFO L514 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] [2021-11-23 13:44:00,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:44:00,725 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1987216090, now seen corresponding path program 1 times [2021-11-23 13:44:00,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:00,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836626275] [2021-11-23 13:44:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:00,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:00,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836626275] [2021-11-23 13:44:00,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836626275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:00,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:00,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:00,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724618051] [2021-11-23 13:44:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:00,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:00,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:00,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:00,860 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:00,901 INFO L93 Difference]: Finished difference Result 231 states and 360 transitions. [2021-11-23 13:44:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:00,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-23 13:44:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:00,905 INFO L225 Difference]: With dead ends: 231 [2021-11-23 13:44:00,907 INFO L226 Difference]: Without dead ends: 121 [2021-11-23 13:44:00,908 INFO L932 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 [2021-11-23 13:44:00,912 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:00,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-23 13:44:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-23 13:44:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2021-11-23 13:44:00,930 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 73 [2021-11-23 13:44:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:00,930 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2021-11-23 13:44:00,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2021-11-23 13:44:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-23 13:44:00,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:00,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:00,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:44:00,935 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 21849430, now seen corresponding path program 1 times [2021-11-23 13:44:00,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570245874] [2021-11-23 13:44:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:00,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570245874] [2021-11-23 13:44:01,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570245874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:01,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121517244] [2021-11-23 13:44:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:01,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:01,014 INFO L87 Difference]: Start difference. First operand 121 states and 186 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,037 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2021-11-23 13:44:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-23 13:44:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,039 INFO L225 Difference]: With dead ends: 227 [2021-11-23 13:44:01,039 INFO L226 Difference]: Without dead ends: 121 [2021-11-23 13:44:01,040 INFO L932 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 [2021-11-23 13:44:01,041 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 7 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 347 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-23 13:44:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-23 13:44:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 120 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2021-11-23 13:44:01,052 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 76 [2021-11-23 13:44:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,053 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2021-11-23 13:44:01,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2021-11-23 13:44:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-23 13:44:01,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:44:01,055 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1419680001, now seen corresponding path program 1 times [2021-11-23 13:44:01,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769129272] [2021-11-23 13:44:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769129272] [2021-11-23 13:44:01,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769129272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:01,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119584103] [2021-11-23 13:44:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:01,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:01,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:01,147 INFO L87 Difference]: Start difference. First operand 121 states and 185 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,177 INFO L93 Difference]: Finished difference Result 223 states and 346 transitions. [2021-11-23 13:44:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-23 13:44:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,181 INFO L225 Difference]: With dead ends: 223 [2021-11-23 13:44:01,181 INFO L226 Difference]: Without dead ends: 121 [2021-11-23 13:44:01,182 INFO L932 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 [2021-11-23 13:44:01,184 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 8 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-23 13:44:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-23 13:44:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 120 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2021-11-23 13:44:01,194 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 79 [2021-11-23 13:44:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,194 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2021-11-23 13:44:01,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2021-11-23 13:44:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:44:01,197 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1762144197, now seen corresponding path program 1 times [2021-11-23 13:44:01,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601842868] [2021-11-23 13:44:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601842868] [2021-11-23 13:44:01,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601842868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:01,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234281331] [2021-11-23 13:44:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:01,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:01,301 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,337 INFO L93 Difference]: Finished difference Result 237 states and 362 transitions. [2021-11-23 13:44:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:44:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,339 INFO L225 Difference]: With dead ends: 237 [2021-11-23 13:44:01,340 INFO L226 Difference]: Without dead ends: 121 [2021-11-23 13:44:01,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:01,342 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 163 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-23 13:44:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-23 13:44:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 120 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 182 transitions. [2021-11-23 13:44:01,354 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 182 transitions. Word has length 82 [2021-11-23 13:44:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,354 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 182 transitions. [2021-11-23 13:44:01,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 182 transitions. [2021-11-23 13:44:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 13:44:01,357 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash 199430461, now seen corresponding path program 1 times [2021-11-23 13:44:01,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79793147] [2021-11-23 13:44:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79793147] [2021-11-23 13:44:01,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79793147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:01,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432348182] [2021-11-23 13:44:01,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:01,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:01,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:01,407 INFO L87 Difference]: Start difference. First operand 121 states and 182 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,445 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. [2021-11-23 13:44:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:01,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,447 INFO L225 Difference]: With dead ends: 236 [2021-11-23 13:44:01,447 INFO L226 Difference]: Without dead ends: 145 [2021-11-23 13:44:01,448 INFO L932 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 [2021-11-23 13:44:01,449 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 23 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 362 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-23 13:44:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-11-23 13:44:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5) internal successors, (216), 144 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 216 transitions. [2021-11-23 13:44:01,464 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 216 transitions. Word has length 82 [2021-11-23 13:44:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,464 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 216 transitions. [2021-11-23 13:44:01,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 216 transitions. [2021-11-23 13:44:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 13:44:01,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash 158755711, now seen corresponding path program 1 times [2021-11-23 13:44:01,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834578067] [2021-11-23 13:44:01,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834578067] [2021-11-23 13:44:01,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834578067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:01,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700334951] [2021-11-23 13:44:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:01,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:01,508 INFO L87 Difference]: Start difference. First operand 145 states and 216 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,541 INFO L93 Difference]: Finished difference Result 366 states and 557 transitions. [2021-11-23 13:44:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,544 INFO L225 Difference]: With dead ends: 366 [2021-11-23 13:44:01,544 INFO L226 Difference]: Without dead ends: 265 [2021-11-23 13:44:01,545 INFO L932 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 [2021-11-23 13:44:01,546 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 149 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 327 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-23 13:44:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2021-11-23 13:44:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 260 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 393 transitions. [2021-11-23 13:44:01,563 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 393 transitions. Word has length 82 [2021-11-23 13:44:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,564 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 393 transitions. [2021-11-23 13:44:01,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 393 transitions. [2021-11-23 13:44:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:44:01,566 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2051119617, now seen corresponding path program 1 times [2021-11-23 13:44:01,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995282089] [2021-11-23 13:44:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995282089] [2021-11-23 13:44:01,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995282089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:01,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177460767] [2021-11-23 13:44:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:01,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:01,613 INFO L87 Difference]: Start difference. First operand 261 states and 393 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,647 INFO L93 Difference]: Finished difference Result 505 states and 777 transitions. [2021-11-23 13:44:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,651 INFO L225 Difference]: With dead ends: 505 [2021-11-23 13:44:01,651 INFO L226 Difference]: Without dead ends: 317 [2021-11-23 13:44:01,651 INFO L932 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 [2021-11-23 13:44:01,652 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-23 13:44:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-11-23 13:44:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.5158227848101267) internal successors, (479), 316 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2021-11-23 13:44:01,672 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 82 [2021-11-23 13:44:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,673 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2021-11-23 13:44:01,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2021-11-23 13:44:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 13:44:01,676 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1350361341, now seen corresponding path program 1 times [2021-11-23 13:44:01,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624306894] [2021-11-23 13:44:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624306894] [2021-11-23 13:44:01,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624306894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:01,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118113164] [2021-11-23 13:44:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:01,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:01,730 INFO L87 Difference]: Start difference. First operand 317 states and 479 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,807 INFO L93 Difference]: Finished difference Result 585 states and 884 transitions. [2021-11-23 13:44:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:44:01,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,810 INFO L225 Difference]: With dead ends: 585 [2021-11-23 13:44:01,810 INFO L226 Difference]: Without dead ends: 389 [2021-11-23 13:44:01,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:44:01,814 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 119 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 714 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-23 13:44:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 323. [2021-11-23 13:44:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.5062111801242235) internal successors, (485), 322 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 485 transitions. [2021-11-23 13:44:01,843 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 485 transitions. Word has length 82 [2021-11-23 13:44:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,844 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 485 transitions. [2021-11-23 13:44:01,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 485 transitions. [2021-11-23 13:44:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 13:44:01,846 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,847 INFO L85 PathProgramCache]: Analyzing trace with hash 321002043, now seen corresponding path program 1 times [2021-11-23 13:44:01,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446167621] [2021-11-23 13:44:01,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446167621] [2021-11-23 13:44:01,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446167621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:01,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44453798] [2021-11-23 13:44:01,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:01,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:01,883 INFO L87 Difference]: Start difference. First operand 323 states and 485 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:01,917 INFO L93 Difference]: Finished difference Result 603 states and 910 transitions. [2021-11-23 13:44:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:01,920 INFO L225 Difference]: With dead ends: 603 [2021-11-23 13:44:01,920 INFO L226 Difference]: Without dead ends: 401 [2021-11-23 13:44:01,921 INFO L932 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 [2021-11-23 13:44:01,922 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 63 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:01,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 320 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-11-23 13:44:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 397. [2021-11-23 13:44:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4974747474747474) internal successors, (593), 396 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 593 transitions. [2021-11-23 13:44:01,942 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 593 transitions. Word has length 82 [2021-11-23 13:44:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:01,942 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 593 transitions. [2021-11-23 13:44:01,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 593 transitions. [2021-11-23 13:44:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 13:44:01,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:01,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:01,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 13:44:01,944 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash -160078215, now seen corresponding path program 1 times [2021-11-23 13:44:01,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537057345] [2021-11-23 13:44:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:01,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:01,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:01,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537057345] [2021-11-23 13:44:01,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537057345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:01,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:01,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:01,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057219367] [2021-11-23 13:44:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:01,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:01,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:01,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:01,988 INFO L87 Difference]: Start difference. First operand 397 states and 593 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:02,060 INFO L93 Difference]: Finished difference Result 851 states and 1268 transitions. [2021-11-23 13:44:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 13:44:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:02,065 INFO L225 Difference]: With dead ends: 851 [2021-11-23 13:44:02,065 INFO L226 Difference]: Without dead ends: 575 [2021-11-23 13:44:02,066 INFO L932 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 [2021-11-23 13:44:02,066 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 354 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:02,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 738 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-23 13:44:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2021-11-23 13:44:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.4664948453608246) internal successors, (569), 388 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 569 transitions. [2021-11-23 13:44:02,091 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 569 transitions. Word has length 82 [2021-11-23 13:44:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:02,092 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 569 transitions. [2021-11-23 13:44:02,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 569 transitions. [2021-11-23 13:44:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-23 13:44:02,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:02,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:02,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 13:44:02,098 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -296544543, now seen corresponding path program 1 times [2021-11-23 13:44:02,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468422892] [2021-11-23 13:44:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:02,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:02,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:02,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468422892] [2021-11-23 13:44:02,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468422892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:02,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:02,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:02,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469904099] [2021-11-23 13:44:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:02,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:02,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:02,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:02,160 INFO L87 Difference]: Start difference. First operand 389 states and 569 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:02,199 INFO L93 Difference]: Finished difference Result 669 states and 980 transitions. [2021-11-23 13:44:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:02,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-23 13:44:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:02,202 INFO L225 Difference]: With dead ends: 669 [2021-11-23 13:44:02,202 INFO L226 Difference]: Without dead ends: 319 [2021-11-23 13:44:02,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:02,205 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:02,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 492 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-11-23 13:44:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2021-11-23 13:44:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4465408805031446) internal successors, (460), 318 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2021-11-23 13:44:02,224 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 85 [2021-11-23 13:44:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:02,224 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2021-11-23 13:44:02,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2021-11-23 13:44:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 13:44:02,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:02,226 INFO L514 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, 1, 1] [2021-11-23 13:44:02,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 13:44:02,227 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 380949780, now seen corresponding path program 1 times [2021-11-23 13:44:02,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:02,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270255921] [2021-11-23 13:44:02,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:02,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:02,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270255921] [2021-11-23 13:44:02,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270255921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:02,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:02,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:02,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314759310] [2021-11-23 13:44:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:02,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:02,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:02,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:02,291 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:02,359 INFO L93 Difference]: Finished difference Result 1039 states and 1511 transitions. [2021-11-23 13:44:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:44:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-23 13:44:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:02,365 INFO L225 Difference]: With dead ends: 1039 [2021-11-23 13:44:02,365 INFO L226 Difference]: Without dead ends: 791 [2021-11-23 13:44:02,366 INFO L932 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 [2021-11-23 13:44:02,367 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 236 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:02,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 659 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-11-23 13:44:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 783. [2021-11-23 13:44:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4526854219948848) internal successors, (1136), 782 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2021-11-23 13:44:02,415 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 97 [2021-11-23 13:44:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:02,415 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2021-11-23 13:44:02,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2021-11-23 13:44:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-23 13:44:02,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:02,418 INFO L514 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, 1, 1, 1] [2021-11-23 13:44:02,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 13:44:02,418 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1002780980, now seen corresponding path program 1 times [2021-11-23 13:44:02,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:02,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543709635] [2021-11-23 13:44:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:02,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:02,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:02,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543709635] [2021-11-23 13:44:02,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543709635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:02,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:02,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:02,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473721612] [2021-11-23 13:44:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:02,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:02,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:02,498 INFO L87 Difference]: Start difference. First operand 783 states and 1136 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:02,600 INFO L93 Difference]: Finished difference Result 1495 states and 2177 transitions. [2021-11-23 13:44:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:44:02,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-23 13:44:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:02,605 INFO L225 Difference]: With dead ends: 1495 [2021-11-23 13:44:02,606 INFO L226 Difference]: Without dead ends: 783 [2021-11-23 13:44:02,607 INFO L932 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 [2021-11-23 13:44:02,608 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 286 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:02,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 342 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2021-11-23 13:44:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2021-11-23 13:44:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4475703324808185) internal successors, (1132), 782 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1132 transitions. [2021-11-23 13:44:02,662 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1132 transitions. Word has length 98 [2021-11-23 13:44:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:02,664 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1132 transitions. [2021-11-23 13:44:02,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1132 transitions. [2021-11-23 13:44:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 13:44:02,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:02,666 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:44:02,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 13:44:02,667 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 151780410, now seen corresponding path program 1 times [2021-11-23 13:44:02,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:02,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499778587] [2021-11-23 13:44:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:02,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:02,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:02,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499778587] [2021-11-23 13:44:02,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499778587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:02,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:02,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:02,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612951195] [2021-11-23 13:44:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:02,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:02,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:02,703 INFO L87 Difference]: Start difference. First operand 783 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:02,809 INFO L93 Difference]: Finished difference Result 2179 states and 3158 transitions. [2021-11-23 13:44:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-23 13:44:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:02,818 INFO L225 Difference]: With dead ends: 2179 [2021-11-23 13:44:02,818 INFO L226 Difference]: Without dead ends: 1467 [2021-11-23 13:44:02,821 INFO L932 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 [2021-11-23 13:44:02,822 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 101 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:02,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 346 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2021-11-23 13:44:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 795. [2021-11-23 13:44:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.4408060453400504) internal successors, (1144), 794 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1144 transitions. [2021-11-23 13:44:02,906 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1144 transitions. Word has length 99 [2021-11-23 13:44:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:02,906 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1144 transitions. [2021-11-23 13:44:02,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2021-11-23 13:44:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 13:44:02,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:02,909 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:44:02,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 13:44:02,909 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2041109337, now seen corresponding path program 1 times [2021-11-23 13:44:02,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:02,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607272462] [2021-11-23 13:44:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:02,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:02,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:02,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607272462] [2021-11-23 13:44:02,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607272462] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:02,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:02,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:02,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520502180] [2021-11-23 13:44:02,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:02,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:02,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:02,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:02,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:02,976 INFO L87 Difference]: Start difference. First operand 795 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:03,069 INFO L93 Difference]: Finished difference Result 1503 states and 2161 transitions. [2021-11-23 13:44:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:44:03,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-23 13:44:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:03,082 INFO L225 Difference]: With dead ends: 1503 [2021-11-23 13:44:03,082 INFO L226 Difference]: Without dead ends: 779 [2021-11-23 13:44:03,083 INFO L932 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 [2021-11-23 13:44:03,085 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 278 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:03,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 325 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-11-23 13:44:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2021-11-23 13:44:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.424164524421594) internal successors, (1108), 778 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1108 transitions. [2021-11-23 13:44:03,167 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1108 transitions. Word has length 100 [2021-11-23 13:44:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:03,168 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 1108 transitions. [2021-11-23 13:44:03,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1108 transitions. [2021-11-23 13:44:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 13:44:03,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:03,171 INFO L514 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, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:03,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 13:44:03,171 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1410373239, now seen corresponding path program 1 times [2021-11-23 13:44:03,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:03,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255539551] [2021-11-23 13:44:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:03,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:03,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:03,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255539551] [2021-11-23 13:44:03,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255539551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:03,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:03,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:03,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065652906] [2021-11-23 13:44:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:03,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:03,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:03,210 INFO L87 Difference]: Start difference. First operand 779 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:03,323 INFO L93 Difference]: Finished difference Result 2179 states and 3112 transitions. [2021-11-23 13:44:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:03,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-23 13:44:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:03,332 INFO L225 Difference]: With dead ends: 2179 [2021-11-23 13:44:03,332 INFO L226 Difference]: Without dead ends: 1471 [2021-11-23 13:44:03,336 INFO L932 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 [2021-11-23 13:44:03,336 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 100 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:03,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2021-11-23 13:44:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 787. [2021-11-23 13:44:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.4198473282442747) internal successors, (1116), 786 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1116 transitions. [2021-11-23 13:44:03,426 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1116 transitions. Word has length 101 [2021-11-23 13:44:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:03,426 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1116 transitions. [2021-11-23 13:44:03,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1116 transitions. [2021-11-23 13:44:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 13:44:03,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:03,429 INFO L514 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, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:03,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 13:44:03,429 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 517899463, now seen corresponding path program 1 times [2021-11-23 13:44:03,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:03,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602795108] [2021-11-23 13:44:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:03,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:03,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:03,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602795108] [2021-11-23 13:44:03,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602795108] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:03,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:03,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:03,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187647208] [2021-11-23 13:44:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:03,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:03,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:03,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:03,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:03,468 INFO L87 Difference]: Start difference. First operand 787 states and 1116 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:03,552 INFO L93 Difference]: Finished difference Result 1729 states and 2445 transitions. [2021-11-23 13:44:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-23 13:44:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:03,560 INFO L225 Difference]: With dead ends: 1729 [2021-11-23 13:44:03,560 INFO L226 Difference]: Without dead ends: 1013 [2021-11-23 13:44:03,562 INFO L932 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 [2021-11-23 13:44:03,562 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 44 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:03,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 348 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-11-23 13:44:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 935. [2021-11-23 13:44:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.4132762312633833) internal successors, (1320), 934 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1320 transitions. [2021-11-23 13:44:03,647 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1320 transitions. Word has length 101 [2021-11-23 13:44:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:03,647 INFO L470 AbstractCegarLoop]: Abstraction has 935 states and 1320 transitions. [2021-11-23 13:44:03,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1320 transitions. [2021-11-23 13:44:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 13:44:03,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:03,650 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:03,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 13:44:03,650 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash -274060690, now seen corresponding path program 1 times [2021-11-23 13:44:03,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:03,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639634166] [2021-11-23 13:44:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:03,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:03,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639634166] [2021-11-23 13:44:03,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639634166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:03,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:03,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:03,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791543811] [2021-11-23 13:44:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:03,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:03,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:03,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:03,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:03,708 INFO L87 Difference]: Start difference. First operand 935 states and 1320 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:03,850 INFO L93 Difference]: Finished difference Result 1951 states and 2756 transitions. [2021-11-23 13:44:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-23 13:44:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:03,857 INFO L225 Difference]: With dead ends: 1951 [2021-11-23 13:44:03,858 INFO L226 Difference]: Without dead ends: 1087 [2021-11-23 13:44:03,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:03,860 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 350 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:03,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 344 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-11-23 13:44:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1083. [2021-11-23 13:44:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.4011090573012939) internal successors, (1516), 1082 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1516 transitions. [2021-11-23 13:44:03,955 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1516 transitions. Word has length 104 [2021-11-23 13:44:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:03,955 INFO L470 AbstractCegarLoop]: Abstraction has 1083 states and 1516 transitions. [2021-11-23 13:44:03,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1516 transitions. [2021-11-23 13:44:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 13:44:03,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:03,958 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:03,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 13:44:03,958 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1649167344, now seen corresponding path program 1 times [2021-11-23 13:44:03,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:03,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005022232] [2021-11-23 13:44:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:03,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:04,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:04,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005022232] [2021-11-23 13:44:04,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005022232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:04,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:04,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:04,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34271586] [2021-11-23 13:44:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:04,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:04,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:04,014 INFO L87 Difference]: Start difference. First operand 1083 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:04,194 INFO L93 Difference]: Finished difference Result 2525 states and 3521 transitions. [2021-11-23 13:44:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:04,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-23 13:44:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:04,203 INFO L225 Difference]: With dead ends: 2525 [2021-11-23 13:44:04,203 INFO L226 Difference]: Without dead ends: 1477 [2021-11-23 13:44:04,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:04,206 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 374 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:04,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 368 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:44:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-11-23 13:44:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1473. [2021-11-23 13:44:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1472 states have (on average 1.3797554347826086) internal successors, (2031), 1472 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2031 transitions. [2021-11-23 13:44:04,352 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2031 transitions. Word has length 104 [2021-11-23 13:44:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:04,352 INFO L470 AbstractCegarLoop]: Abstraction has 1473 states and 2031 transitions. [2021-11-23 13:44:04,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2031 transitions. [2021-11-23 13:44:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 13:44:04,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:04,356 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:04,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 13:44:04,356 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1711206958, now seen corresponding path program 1 times [2021-11-23 13:44:04,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:04,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693550547] [2021-11-23 13:44:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:04,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:04,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693550547] [2021-11-23 13:44:04,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693550547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:04,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:04,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:04,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709652804] [2021-11-23 13:44:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:04,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:04,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:04,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:04,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:04,419 INFO L87 Difference]: Start difference. First operand 1473 states and 2031 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:04,659 INFO L93 Difference]: Finished difference Result 3529 states and 4833 transitions. [2021-11-23 13:44:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-23 13:44:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:04,672 INFO L225 Difference]: With dead ends: 3529 [2021-11-23 13:44:04,673 INFO L226 Difference]: Without dead ends: 2119 [2021-11-23 13:44:04,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:04,676 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 370 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:04,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 360 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-11-23 13:44:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2115. [2021-11-23 13:44:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2114 states have (on average 1.3543046357615893) internal successors, (2863), 2114 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2863 transitions. [2021-11-23 13:44:04,876 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2863 transitions. Word has length 104 [2021-11-23 13:44:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:04,877 INFO L470 AbstractCegarLoop]: Abstraction has 2115 states and 2863 transitions. [2021-11-23 13:44:04,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2863 transitions. [2021-11-23 13:44:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 13:44:04,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:04,880 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:04,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 13:44:04,881 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1851755568, now seen corresponding path program 1 times [2021-11-23 13:44:04,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:04,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977350992] [2021-11-23 13:44:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:04,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:04,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:04,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977350992] [2021-11-23 13:44:04,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977350992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:04,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:04,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:04,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846480688] [2021-11-23 13:44:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:04,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:04,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:04,953 INFO L87 Difference]: Start difference. First operand 2115 states and 2863 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:05,259 INFO L93 Difference]: Finished difference Result 4809 states and 6518 transitions. [2021-11-23 13:44:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:44:05,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-23 13:44:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:05,275 INFO L225 Difference]: With dead ends: 4809 [2021-11-23 13:44:05,275 INFO L226 Difference]: Without dead ends: 2817 [2021-11-23 13:44:05,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:44:05,280 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 611 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:05,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 519 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:44:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2021-11-23 13:44:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2265. [2021-11-23 13:44:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.3418727915194346) internal successors, (3038), 2264 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3038 transitions. [2021-11-23 13:44:05,473 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3038 transitions. Word has length 104 [2021-11-23 13:44:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:05,474 INFO L470 AbstractCegarLoop]: Abstraction has 2265 states and 3038 transitions. [2021-11-23 13:44:05,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3038 transitions. [2021-11-23 13:44:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 13:44:05,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:05,477 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:05,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 13:44:05,478 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1821084671, now seen corresponding path program 1 times [2021-11-23 13:44:05,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:05,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869866897] [2021-11-23 13:44:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:05,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:05,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869866897] [2021-11-23 13:44:05,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869866897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:05,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:05,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:05,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669737854] [2021-11-23 13:44:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:05,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:05,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:05,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:05,542 INFO L87 Difference]: Start difference. First operand 2265 states and 3038 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:05,899 INFO L93 Difference]: Finished difference Result 5415 states and 7254 transitions. [2021-11-23 13:44:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:44:05,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-23 13:44:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:05,919 INFO L225 Difference]: With dead ends: 5415 [2021-11-23 13:44:05,919 INFO L226 Difference]: Without dead ends: 3303 [2021-11-23 13:44:05,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:44:05,924 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 650 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:05,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 561 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:44:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2021-11-23 13:44:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2557. [2021-11-23 13:44:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.3262910798122065) internal successors, (3390), 2556 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3390 transitions. [2021-11-23 13:44:06,151 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3390 transitions. Word has length 105 [2021-11-23 13:44:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:06,151 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 3390 transitions. [2021-11-23 13:44:06,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3390 transitions. [2021-11-23 13:44:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-23 13:44:06,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:06,156 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:06,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 13:44:06,156 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1650223701, now seen corresponding path program 1 times [2021-11-23 13:44:06,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:06,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011526539] [2021-11-23 13:44:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:06,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:06,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:06,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011526539] [2021-11-23 13:44:06,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011526539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:06,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:06,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:06,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924895110] [2021-11-23 13:44:06,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:06,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:06,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:06,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:06,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:06,211 INFO L87 Difference]: Start difference. First operand 2557 states and 3390 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:06,608 INFO L93 Difference]: Finished difference Result 6302 states and 8323 transitions. [2021-11-23 13:44:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:44:06,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-23 13:44:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:06,631 INFO L225 Difference]: With dead ends: 6302 [2021-11-23 13:44:06,631 INFO L226 Difference]: Without dead ends: 3946 [2021-11-23 13:44:06,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:44:06,637 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 646 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:06,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 563 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:44:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-11-23 13:44:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3055. [2021-11-23 13:44:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 3054 states have (on average 1.3077930582842174) internal successors, (3994), 3054 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 3994 transitions. [2021-11-23 13:44:06,927 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 3994 transitions. Word has length 106 [2021-11-23 13:44:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:06,927 INFO L470 AbstractCegarLoop]: Abstraction has 3055 states and 3994 transitions. [2021-11-23 13:44:06,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3994 transitions. [2021-11-23 13:44:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:06,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:06,932 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:06,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 13:44:06,932 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -754854780, now seen corresponding path program 1 times [2021-11-23 13:44:06,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:06,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102154594] [2021-11-23 13:44:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:06,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:06,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102154594] [2021-11-23 13:44:06,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102154594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:06,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:06,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:06,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498658475] [2021-11-23 13:44:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:06,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:06,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:06,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:06,978 INFO L87 Difference]: Start difference. First operand 3055 states and 3994 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:07,374 INFO L93 Difference]: Finished difference Result 6717 states and 8830 transitions. [2021-11-23 13:44:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:44:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:07,397 INFO L225 Difference]: With dead ends: 6717 [2021-11-23 13:44:07,397 INFO L226 Difference]: Without dead ends: 3967 [2021-11-23 13:44:07,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:44:07,403 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 577 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:07,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 510 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:44:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-23 13:44:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3959. [2021-11-23 13:44:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3958 states have (on average 1.303688731682668) internal successors, (5160), 3958 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5160 transitions. [2021-11-23 13:44:07,793 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5160 transitions. Word has length 107 [2021-11-23 13:44:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:07,793 INFO L470 AbstractCegarLoop]: Abstraction has 3959 states and 5160 transitions. [2021-11-23 13:44:07,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5160 transitions. [2021-11-23 13:44:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:07,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:07,800 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:07,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 13:44:07,801 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash -918958968, now seen corresponding path program 1 times [2021-11-23 13:44:07,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:07,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382877409] [2021-11-23 13:44:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:07,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:07,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:07,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382877409] [2021-11-23 13:44:07,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382877409] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:07,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:07,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:07,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831318535] [2021-11-23 13:44:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:07,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:07,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:07,846 INFO L87 Difference]: Start difference. First operand 3959 states and 5160 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:08,283 INFO L93 Difference]: Finished difference Result 9353 states and 12225 transitions. [2021-11-23 13:44:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:08,318 INFO L225 Difference]: With dead ends: 9353 [2021-11-23 13:44:08,318 INFO L226 Difference]: Without dead ends: 5700 [2021-11-23 13:44:08,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:44:08,325 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 282 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:08,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 713 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2021-11-23 13:44:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 3938. [2021-11-23 13:44:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 1.3030226060452121) internal successors, (5130), 3937 states have internal predecessors, (5130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5130 transitions. [2021-11-23 13:44:08,680 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5130 transitions. Word has length 107 [2021-11-23 13:44:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:08,680 INFO L470 AbstractCegarLoop]: Abstraction has 3938 states and 5130 transitions. [2021-11-23 13:44:08,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5130 transitions. [2021-11-23 13:44:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:08,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:08,686 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:08,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 13:44:08,687 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1381863622, now seen corresponding path program 1 times [2021-11-23 13:44:08,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833191315] [2021-11-23 13:44:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:08,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:08,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:08,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833191315] [2021-11-23 13:44:08,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833191315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:08,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:08,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:08,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187083246] [2021-11-23 13:44:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:08,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:08,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:08,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:08,743 INFO L87 Difference]: Start difference. First operand 3938 states and 5130 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:09,099 INFO L93 Difference]: Finished difference Result 7582 states and 9891 transitions. [2021-11-23 13:44:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:44:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:09,109 INFO L225 Difference]: With dead ends: 7582 [2021-11-23 13:44:09,110 INFO L226 Difference]: Without dead ends: 3950 [2021-11-23 13:44:09,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:09,115 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 312 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:09,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 391 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-11-23 13:44:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3938. [2021-11-23 13:44:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 1.2931165862331724) internal successors, (5091), 3937 states have internal predecessors, (5091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5091 transitions. [2021-11-23 13:44:09,370 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5091 transitions. Word has length 107 [2021-11-23 13:44:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:09,370 INFO L470 AbstractCegarLoop]: Abstraction has 3938 states and 5091 transitions. [2021-11-23 13:44:09,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5091 transitions. [2021-11-23 13:44:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:09,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:09,376 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:09,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 13:44:09,377 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash 988836612, now seen corresponding path program 1 times [2021-11-23 13:44:09,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:09,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651211962] [2021-11-23 13:44:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:09,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:09,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:09,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651211962] [2021-11-23 13:44:09,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651211962] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:09,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:09,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:09,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596187348] [2021-11-23 13:44:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:09,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:09,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:09,418 INFO L87 Difference]: Start difference. First operand 3938 states and 5091 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:10,069 INFO L93 Difference]: Finished difference Result 10203 states and 13133 transitions. [2021-11-23 13:44:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:44:10,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:10,086 INFO L225 Difference]: With dead ends: 10203 [2021-11-23 13:44:10,087 INFO L226 Difference]: Without dead ends: 6571 [2021-11-23 13:44:10,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:44:10,094 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 283 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:10,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 681 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6571 states. [2021-11-23 13:44:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6571 to 3938. [2021-11-23 13:44:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 1.2908305816611634) internal successors, (5082), 3937 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5082 transitions. [2021-11-23 13:44:10,423 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5082 transitions. Word has length 107 [2021-11-23 13:44:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:10,423 INFO L470 AbstractCegarLoop]: Abstraction has 3938 states and 5082 transitions. [2021-11-23 13:44:10,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5082 transitions. [2021-11-23 13:44:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:10,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:10,429 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:10,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 13:44:10,430 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1531123322, now seen corresponding path program 1 times [2021-11-23 13:44:10,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:10,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815854599] [2021-11-23 13:44:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:10,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:44:10,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:10,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815854599] [2021-11-23 13:44:10,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815854599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:10,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:10,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:44:10,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382356859] [2021-11-23 13:44:10,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:10,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:44:10,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:44:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:44:10,465 INFO L87 Difference]: Start difference. First operand 3938 states and 5082 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:10,738 INFO L93 Difference]: Finished difference Result 5308 states and 6814 transitions. [2021-11-23 13:44:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:44:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:10,749 INFO L225 Difference]: With dead ends: 5308 [2021-11-23 13:44:10,750 INFO L226 Difference]: Without dead ends: 5304 [2021-11-23 13:44:10,752 INFO L932 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 [2021-11-23 13:44:10,753 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 61 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:10,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 316 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2021-11-23 13:44:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 5304. [2021-11-23 13:44:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 5303 states have (on average 1.2832359042051669) internal successors, (6805), 5303 states have internal predecessors, (6805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 6805 transitions. [2021-11-23 13:44:11,149 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 6805 transitions. Word has length 107 [2021-11-23 13:44:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:11,150 INFO L470 AbstractCegarLoop]: Abstraction has 5304 states and 6805 transitions. [2021-11-23 13:44:11,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 6805 transitions. [2021-11-23 13:44:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:11,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:11,156 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:11,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 13:44:11,157 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash 392654924, now seen corresponding path program 1 times [2021-11-23 13:44:11,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:11,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353040105] [2021-11-23 13:44:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:11,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:11,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:11,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353040105] [2021-11-23 13:44:11,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353040105] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:44:11,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109127070] [2021-11-23 13:44:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:11,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:44:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:44:11,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:44:11,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 13:44:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:11,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 13:44:11,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:44:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:11,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:44:11,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109127070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:11,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 13:44:11,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-23 13:44:11,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137021697] [2021-11-23 13:44:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:11,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:11,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:11,709 INFO L87 Difference]: Start difference. First operand 5304 states and 6805 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:12,212 INFO L93 Difference]: Finished difference Result 9200 states and 11867 transitions. [2021-11-23 13:44:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:44:12,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:12,226 INFO L225 Difference]: With dead ends: 9200 [2021-11-23 13:44:12,226 INFO L226 Difference]: Without dead ends: 5439 [2021-11-23 13:44:12,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:12,232 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 276 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:12,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 309 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2021-11-23 13:44:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5439. [2021-11-23 13:44:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5438 states have (on average 1.2789628539904376) internal successors, (6955), 5438 states have internal predecessors, (6955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 6955 transitions. [2021-11-23 13:44:12,751 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 6955 transitions. Word has length 107 [2021-11-23 13:44:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:12,752 INFO L470 AbstractCegarLoop]: Abstraction has 5439 states and 6955 transitions. [2021-11-23 13:44:12,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 6955 transitions. [2021-11-23 13:44:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:12,756 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:12,757 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:12,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 13:44:12,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:44:12,973 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash 377136206, now seen corresponding path program 1 times [2021-11-23 13:44:12,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:12,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061618350] [2021-11-23 13:44:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:12,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:13,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:13,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061618350] [2021-11-23 13:44:13,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061618350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:13,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:13,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:13,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582787291] [2021-11-23 13:44:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:13,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:13,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:13,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:13,013 INFO L87 Difference]: Start difference. First operand 5439 states and 6955 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:13,752 INFO L93 Difference]: Finished difference Result 15403 states and 19713 transitions. [2021-11-23 13:44:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:44:13,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:13,777 INFO L225 Difference]: With dead ends: 15403 [2021-11-23 13:44:13,777 INFO L226 Difference]: Without dead ends: 10141 [2021-11-23 13:44:13,787 INFO L932 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 [2021-11-23 13:44:13,788 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:13,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 525 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10141 states. [2021-11-23 13:44:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10141 to 5463. [2021-11-23 13:44:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5463 states, 5462 states have (on average 1.2777370926400586) internal successors, (6979), 5462 states have internal predecessors, (6979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6979 transitions. [2021-11-23 13:44:14,270 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6979 transitions. Word has length 107 [2021-11-23 13:44:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:14,270 INFO L470 AbstractCegarLoop]: Abstraction has 5463 states and 6979 transitions. [2021-11-23 13:44:14,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6979 transitions. [2021-11-23 13:44:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 13:44:14,274 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:14,274 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:14,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-23 13:44:14,275 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1120529074, now seen corresponding path program 1 times [2021-11-23 13:44:14,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:14,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820795746] [2021-11-23 13:44:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:14,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:44:14,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820795746] [2021-11-23 13:44:14,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820795746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:14,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:14,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:44:14,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641651075] [2021-11-23 13:44:14,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:14,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:44:14,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:14,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:44:14,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:44:14,315 INFO L87 Difference]: Start difference. First operand 5463 states and 6979 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:14,797 INFO L93 Difference]: Finished difference Result 10589 states and 13533 transitions. [2021-11-23 13:44:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:44:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-23 13:44:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:14,813 INFO L225 Difference]: With dead ends: 10589 [2021-11-23 13:44:14,813 INFO L226 Difference]: Without dead ends: 5303 [2021-11-23 13:44:14,821 INFO L932 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 [2021-11-23 13:44:14,822 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 263 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:14,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 329 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2021-11-23 13:44:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5303. [2021-11-23 13:44:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5303 states, 5302 states have (on average 1.2749905695963788) internal successors, (6760), 5302 states have internal predecessors, (6760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 6760 transitions. [2021-11-23 13:44:15,275 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 6760 transitions. Word has length 107 [2021-11-23 13:44:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:15,276 INFO L470 AbstractCegarLoop]: Abstraction has 5303 states and 6760 transitions. [2021-11-23 13:44:15,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 6760 transitions. [2021-11-23 13:44:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-23 13:44:15,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:44:15,281 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:44:15,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 13:44:15,282 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:44:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:44:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1901059480, now seen corresponding path program 1 times [2021-11-23 13:44:15,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:44:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158170641] [2021-11-23 13:44:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:44:15,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:44:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:44:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-23 13:44:15,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:44:15,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158170641] [2021-11-23 13:44:15,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158170641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:44:15,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:44:15,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:44:15,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615105429] [2021-11-23 13:44:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:44:15,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:44:15,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:44:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:44:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:44:15,327 INFO L87 Difference]: Start difference. First operand 5303 states and 6760 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:44:15,396 INFO L93 Difference]: Finished difference Result 5620 states and 7139 transitions. [2021-11-23 13:44:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:44:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2021-11-23 13:44:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:44:15,397 INFO L225 Difference]: With dead ends: 5620 [2021-11-23 13:44:15,398 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 13:44:15,403 INFO L932 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 [2021-11-23 13:44:15,404 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:44:15,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 288 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:44:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 13:44:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 13:44:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 13:44:15,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2021-11-23 13:44:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:44:15,406 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 13:44:15,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:44:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 13:44:15,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 13:44:15,409 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 13:44:15,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-23 13:44:15,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 13:47:56,184 WARN L227 SmtUtils]: Spent 3.67m on a formula simplification. DAG size of input: 123 DAG size of output: 104 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 13:48:09,525 INFO L854 garLoopResultBuilder]: At program point L432-2(lines 432 454) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,525 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-11-23 13:48:09,526 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2021-11-23 13:48:09,526 INFO L858 garLoopResultBuilder]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2021-11-23 13:48:09,526 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2021-11-23 13:48:09,526 INFO L858 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2021-11-23 13:48:09,526 INFO L858 garLoopResultBuilder]: For program point L137-3(lines 137 142) no Hoare annotation was computed. [2021-11-23 13:48:09,526 INFO L858 garLoopResultBuilder]: For program point L137-5(lines 137 142) no Hoare annotation was computed. [2021-11-23 13:48:09,527 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2021-11-23 13:48:09,527 INFO L858 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2021-11-23 13:48:09,527 INFO L858 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,527 INFO L858 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,527 INFO L858 garLoopResultBuilder]: For program point L369-3(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,527 INFO L858 garLoopResultBuilder]: For program point L336-3(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,528 INFO L854 garLoopResultBuilder]: At program point L205(lines 193 207) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,528 INFO L854 garLoopResultBuilder]: At program point L205-1(lines 193 207) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~z_ev~0 ~d1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~d1_ev~0 0) .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,528 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2021-11-23 13:48:09,528 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2021-11-23 13:48:09,528 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2021-11-23 13:48:09,529 INFO L858 garLoopResultBuilder]: For program point L107-1(lines 107 127) no Hoare annotation was computed. [2021-11-23 13:48:09,529 INFO L854 garLoopResultBuilder]: At program point L240-1(lines 208 250) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,529 INFO L854 garLoopResultBuilder]: At program point L240-3(lines 208 250) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~z_ev~0 ~d1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~d1_ev~0 0) .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,529 INFO L854 garLoopResultBuilder]: At program point L175(lines 163 177) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~b1_ev~0 1)) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,530 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 163 177) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~b1_ev~0 1))) (.cse12 (not (= ~d0_val~0 0))) (.cse13 (not (= ~b1_val_t~0 0))) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse15 (not (= ~d1_val~0 0))) (.cse16 (= ~z_val~0 0)) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~z_req_up~0 1) .cse17 .cse18 .cse19))) [2021-11-23 13:48:09,530 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2021-11-23 13:48:09,530 INFO L854 garLoopResultBuilder]: At program point L374-1(lines 350 382) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,530 INFO L854 garLoopResultBuilder]: At program point L341-1(lines 317 349) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,531 INFO L854 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0))) (let ((.cse20 (not .cse3)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse12 (not (= ~d0_val~0 0))) (.cse13 (not (= ~b1_val_t~0 0))) (.cse21 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 1) .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 (= ~z_req_up~0 1) .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse19)))) [2021-11-23 13:48:09,531 INFO L854 garLoopResultBuilder]: At program point L374-3(lines 350 382) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse12 (not (= ~d0_val~0 0))) (.cse13 (not (= ~b1_val_t~0 0))) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse15 (not (= ~d1_val~0 0))) (.cse16 (= ~z_val~0 0)) (.cse17 (not (= ~b1_ev~0 0))) (.cse18 (not (= ~d0_val_t~0 0))) (.cse19 (not (= ~b1_val~0 0))) (.cse20 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse20) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-23 13:48:09,531 INFO L854 garLoopResultBuilder]: At program point L341-3(lines 317 349) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~d0_val~0 0))) (.cse11 (not (= ~b1_val_t~0 0))) (.cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~d1_ev~0 1) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~z_ev~0 ~d1_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,532 INFO L854 garLoopResultBuilder]: At program point L275-1(lines 267 277) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,532 INFO L854 garLoopResultBuilder]: At program point L276(lines 264 278) the Hoare annotation is: (let ((.cse22 (= ~comp_m1_st~0 0))) (let ((.cse0 (not .cse22)) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse18 (not (= ~b1_ev~0 0))) (.cse19 (not (= ~d0_val_t~0 0))) (.cse20 (not (= ~b1_val~0 0))) (.cse21 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~z_req_up~0 1) .cse19 .cse20 .cse21) (and (= |ULTIMATE.start_exists_runnable_thread_#res#1| 1) .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 1) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse21)))) [2021-11-23 13:48:09,532 INFO L854 garLoopResultBuilder]: At program point L276-1(lines 264 278) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,532 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2021-11-23 13:48:09,533 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 111 126) no Hoare annotation was computed. [2021-11-23 13:48:09,533 INFO L854 garLoopResultBuilder]: At program point L145(lines 133 147) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~b1_ev~0 ~z_ev~0) (= ~comp_m1_st~0 0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (= ~z_ev~0 ~d0_ev~0) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1)) (= 1 ~b1_req_up~0)) [2021-11-23 13:48:09,533 INFO L854 garLoopResultBuilder]: At program point L145-1(lines 133 147) the Hoare annotation is: false [2021-11-23 13:48:09,533 INFO L858 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2021-11-23 13:48:09,533 INFO L861 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2021-11-23 13:48:09,534 INFO L854 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse18 (not (= ~b1_ev~0 0))) (.cse19 (not (= ~d0_val_t~0 0))) (.cse20 (not (= ~b1_val~0 0))) (.cse21 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~z_req_up~0 1) .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse21))) [2021-11-23 13:48:09,534 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 218) no Hoare annotation was computed. [2021-11-23 13:48:09,534 INFO L858 garLoopResultBuilder]: For program point L212-2(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,534 INFO L858 garLoopResultBuilder]: For program point L212-3(lines 212 218) no Hoare annotation was computed. [2021-11-23 13:48:09,534 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L212-5(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 115 125) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L182-3(lines 182 187) no Hoare annotation was computed. [2021-11-23 13:48:09,535 INFO L858 garLoopResultBuilder]: For program point L182-5(lines 182 187) no Hoare annotation was computed. [2021-11-23 13:48:09,536 INFO L854 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,536 INFO L854 garLoopResultBuilder]: At program point L415(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,536 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2021-11-23 13:48:09,536 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2021-11-23 13:48:09,537 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 119 124) no Hoare annotation was computed. [2021-11-23 13:48:09,538 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-11-23 13:48:09,538 INFO L858 garLoopResultBuilder]: For program point L152-3(lines 152 157) no Hoare annotation was computed. [2021-11-23 13:48:09,538 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2021-11-23 13:48:09,538 INFO L858 garLoopResultBuilder]: For program point L152-5(lines 152 157) no Hoare annotation was computed. [2021-11-23 13:48:09,538 INFO L858 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,538 INFO L858 garLoopResultBuilder]: For program point L219-3(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,539 INFO L858 garLoopResultBuilder]: For program point L286(line 286) no Hoare annotation was computed. [2021-11-23 13:48:09,539 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2021-11-23 13:48:09,539 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 325) no Hoare annotation was computed. [2021-11-23 13:48:09,539 INFO L858 garLoopResultBuilder]: For program point L354-2(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,539 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2021-11-23 13:48:09,539 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,540 INFO L858 garLoopResultBuilder]: For program point L354-3(lines 354 358) no Hoare annotation was computed. [2021-11-23 13:48:09,540 INFO L858 garLoopResultBuilder]: For program point L321-3(lines 321 325) no Hoare annotation was computed. [2021-11-23 13:48:09,540 INFO L854 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,540 INFO L858 garLoopResultBuilder]: For program point L354-5(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,540 INFO L858 garLoopResultBuilder]: For program point L321-5(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,541 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 13:48:09,541 INFO L854 garLoopResultBuilder]: At program point L190(lines 178 192) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~d1_ev~0 0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,541 INFO L854 garLoopResultBuilder]: At program point L190-1(lines 178 192) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse25 (= ~d1_ev~0 0)) (.cse20 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0)) (.cse21 (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0)) (.cse22 (= |ULTIMATE.start_is_method1_triggered_#res#1| 0)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse7 (= ~z_ev~0 2)) (.cse8 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse9 (not (= ~b0_ev~0 1))) (.cse24 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|))) (.cse10 (not (= ~comp_m1_i~0 1))) (.cse11 (= ~z_ev~0 ~d1_ev~0)) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse26 (= ~z_req_up~0 1)) (.cse18 (not (= ~d0_val_t~0 0))) (.cse19 (not (= ~b1_val~0 0))) (.cse23 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse26 .cse18 .cse19 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19 .cse23))) [2021-11-23 13:48:09,541 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-11-23 13:48:09,541 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2021-11-23 13:48:09,542 INFO L854 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (and (not (= ~d1_ev~0 1)) (not (= ~b0_ev~0 0)) (not (= ~d0_ev~0 1)) (not (= ~b0_ev~0 1)) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0))) [2021-11-23 13:48:09,542 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2021-11-23 13:48:09,542 INFO L858 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2021-11-23 13:48:09,542 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2021-11-23 13:48:09,542 INFO L854 garLoopResultBuilder]: At program point L390-2(lines 383 398) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (= ~comp_m1_st~0 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 1) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_#res#1| 1) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,543 INFO L858 garLoopResultBuilder]: For program point L390-3(lines 390 394) no Hoare annotation was computed. [2021-11-23 13:48:09,543 INFO L854 garLoopResultBuilder]: At program point L390-5(lines 383 398) the Hoare annotation is: (let ((.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (not (= ~d0_ev~0 1)) .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~b1_ev~0 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse19) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_is_method1_triggered_#res#1| 1) .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) .cse19))) [2021-11-23 13:48:09,543 INFO L854 garLoopResultBuilder]: At program point L490(lines 461 492) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~b1_ev~0 ~z_ev~0) (= ~comp_m1_st~0 0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~z_ev~0 2) (= ~comp_m1_i~0 ~b0_val~0) (= ~z_ev~0 ~d0_ev~0) (= ~z_ev~0 ~d1_ev~0) (= ~b0_val_t~0 1) (= ~d0_req_up~0 1) (= ~b0_val~0 ~d1_val~0) (= ~b0_val~0 0) (= ~d1_val_t~0 ~b0_val_t~0) (= ~z_val~0 0) (= ~d1_req_up~0 1) (= ~b0_ev~0 ~z_ev~0) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0)) [2021-11-23 13:48:09,543 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,544 INFO L854 garLoopResultBuilder]: At program point L160(lines 148 162) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (= ~z_ev~0 ~d0_ev~0) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~b1_ev~0 1)) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,544 INFO L854 garLoopResultBuilder]: At program point L160-1(lines 148 162) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse8 (not (= ~b0_ev~0 1))) (.cse9 (not (= ~comp_m1_i~0 1))) (.cse10 (= ~z_ev~0 ~d1_ev~0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (not (= ~d0_val~0 0))) (.cse14 (not (= ~b1_val_t~0 0))) (.cse15 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse16 (not (= ~d1_val~0 0))) (.cse17 (= ~z_val~0 0)) (.cse18 (not (= ~d0_val_t~0 0))) (.cse19 (not (= ~b1_val~0 0))) (.cse20 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~z_req_up~0 1) .cse18 .cse19 .cse20))) [2021-11-23 13:48:09,544 INFO L858 garLoopResultBuilder]: For program point L226-3(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,544 INFO L858 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2021-11-23 13:48:09,544 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-23 13:48:09,545 INFO L858 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,545 INFO L858 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,545 INFO L858 garLoopResultBuilder]: For program point L359-3(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,545 INFO L858 garLoopResultBuilder]: For program point L326-3(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,545 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2021-11-23 13:48:09,545 INFO L854 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,546 INFO L854 garLoopResultBuilder]: At program point L129-1(lines 106 131) the Hoare annotation is: (let ((.cse9 (= ~z_ev~0 ~d1_ev~0)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse10 (not (= ~d0_ev~0 0))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1)) (.cse20 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~b1_ev~0 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~d1_ev~0 1) .cse20))) [2021-11-23 13:48:09,546 INFO L854 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= ~b0_ev~0 0))) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~comp_m1_i~0 1))) (.cse8 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (not (= ~d0_val~0 0))) (.cse12 (not (= ~b1_val_t~0 0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (= ~z_val~0 0)) (.cse15 (not (= ~b1_ev~0 0))) (.cse16 (not (= ~d0_val_t~0 0))) (.cse17 (not (= ~b1_val~0 0))) (.cse18 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~z_req_up~0 1) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse5 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse18) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:48:09,546 INFO L854 garLoopResultBuilder]: At program point L130(lines 103 132) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~comp_m1_i~0 1)) (not (= ~d0_ev~0 0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_#res#1| 1) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1) (= ~d1_ev~0 1) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,547 INFO L854 garLoopResultBuilder]: At program point L130-1(lines 103 132) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_is_method1_triggered_#res#1| 1)) (.cse19 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 1)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (= ~d1_val_t~0 0))) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (not (= ~b0_ev~0 0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (.cse7 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~comp_m1_i~0 1))) (.cse21 (= ~z_ev~0 ~d1_ev~0)) (.cse9 (not (= ~d0_ev~0 0))) (.cse10 (not (= ~d0_val~0 0))) (.cse11 (not (= ~b1_val_t~0 0))) (.cse12 (= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0)) (.cse13 (not (= ~d1_val~0 0))) (.cse15 (= ~z_val~0 0)) (.cse16 (not (= ~b1_ev~0 0))) (.cse17 (not (= ~d0_val_t~0 0))) (.cse18 (not (= ~b1_val~0 0))) (.cse20 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~d1_ev~0 1) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 (not (= ~b1_ev~0 1)) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_method1_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_is_method1_triggered_#res#1| 0) .cse20))) [2021-11-23 13:48:09,547 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-11-23 13:48:09,547 INFO L858 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-11-23 13:48:09,547 INFO L858 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-11-23 13:48:09,547 INFO L858 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-11-23 13:48:09,547 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-23 13:48:09,548 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-23 13:48:09,548 INFO L858 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,548 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,548 INFO L858 garLoopResultBuilder]: For program point L364-3(lines 353 381) no Hoare annotation was computed. [2021-11-23 13:48:09,548 INFO L858 garLoopResultBuilder]: For program point L331-3(lines 320 348) no Hoare annotation was computed. [2021-11-23 13:48:09,548 INFO L854 garLoopResultBuilder]: At program point L100(lines 46 102) the Hoare annotation is: (and (not (= ~comp_m1_st~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_ev~0 0)) (not (= ~d0_ev~0 1)) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~b0_ev~0 1)) (not (= 0 |ULTIMATE.start_method1_~s3~0#1|)) (not (= ~comp_m1_i~0 1)) (= ~z_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (not (= ~b1_ev~0 1)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~b1_ev~0 0)) (= ~z_req_up~0 1) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (not (= ~b0_req_up~0 1))) [2021-11-23 13:48:09,549 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2021-11-23 13:48:09,549 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,549 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:48:09,549 INFO L858 garLoopResultBuilder]: For program point L233-3(lines 211 249) no Hoare annotation was computed. [2021-11-23 13:48:09,549 INFO L858 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:48:09,549 INFO L858 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:48:09,550 INFO L858 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:48:09,553 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-23 13:48:09,554 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:48:09,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:48:09 BoogieIcfgContainer [2021-11-23 13:48:09,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:48:09,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:48:09,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:48:09,622 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:48:09,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:44:00" (3/4) ... [2021-11-23 13:48:09,625 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 13:48:09,642 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-23 13:48:09,643 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-23 13:48:09,644 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-23 13:48:09,645 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 13:48:09,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) [2021-11-23 13:48:09,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) [2021-11-23 13:48:09,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-23 13:48:09,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-23 13:48:09,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((\result == 1 && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-23 13:48:09,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) [2021-11-23 13:48:09,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) [2021-11-23 13:48:09,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) [2021-11-23 13:48:09,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-11-23 13:48:09,717 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:48:09,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:48:09,718 INFO L158 Benchmark]: Toolchain (without parser) took 250700.52ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 62.4MB in the beginning and 921.9MB in the end (delta: -859.5MB). Peak memory consumption was 956.9MB. Max. memory is 16.1GB. [2021-11-23 13:48:09,718 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:48:09,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.83ms. Allocated memory is still 96.5MB. Free memory was 62.2MB in the beginning and 69.3MB in the end (delta: -7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 13:48:09,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.15ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 66.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:48:09,719 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 65.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:48:09,719 INFO L158 Benchmark]: RCFGBuilder took 611.25ms. Allocated memory is still 96.5MB. Free memory was 64.7MB in the beginning and 47.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-23 13:48:09,720 INFO L158 Benchmark]: TraceAbstraction took 249499.83ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 46.7MB in the beginning and 930.2MB in the end (delta: -883.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-23 13:48:09,720 INFO L158 Benchmark]: Witness Printer took 95.80ms. Allocated memory is still 1.9GB. Free memory was 930.2MB in the beginning and 921.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 13:48:09,722 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.26ms. Allocated memory is still 96.5MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.83ms. Allocated memory is still 96.5MB. Free memory was 62.2MB in the beginning and 69.3MB in the end (delta: -7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.15ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 66.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 65.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.25ms. Allocated memory is still 96.5MB. Free memory was 64.7MB in the beginning and 47.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 249499.83ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 46.7MB in the beginning and 930.2MB in the end (delta: -883.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 95.80ms. Allocated memory is still 1.9GB. Free memory was 930.2MB in the beginning and 921.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 249.4s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 234.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7212 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7212 mSDsluCounter, 14222 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7983 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 793 IncrementalHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 6239 mSDtfsCounter, 793 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5463occurred in iteration=31, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 12996 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 37 PreInvPairs, 195 NumberOfFragments, 4846 HoareAnnotationTreeSize, 37 FomulaSimplifications, 28304704 FormulaSimplificationTreeSizeReduction, 223.4s HoareSimplificationTime, 37 FomulaSimplificationsInter, 2224938 FormulaSimplificationTreeSizeReductionInter, 10.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3275 NumberOfCodeBlocks, 3275 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3241 ConstructedInterpolants, 0 QuantifiedInterpolants, 6589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 34 InterpolantComputations, 33 PerfectInterpolantSequences, 204/210 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((\result == 1 && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d1_val_t == d1_val)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((((!(d1_ev == 1) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1)) || ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((((((((((((b0_req_up == 1 && 0 == z_val_t) && b1_ev == z_ev) && comp_m1_st == 0) && d0_val_t == b0_val_t) && z_ev == 2) && comp_m1_i == b0_val) && z_ev == d0_ev) && z_ev == d1_ev) && b0_val_t == 1) && d0_req_up == 1) && b0_val == d1_val) && b0_val == 0) && d1_val_t == b0_val_t) && z_val == 0) && d1_req_up == 1) && b0_ev == z_ev) && 1 == b1_req_up) && b1_val_t == b0_val_t - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && z_ev == d0_ev) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d1_val_t == d1_val)) && !(b1_val_t == 0)) && d0_req_up == 1) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1))) || ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && tmp == 1) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && b1_ev == z_ev) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && z_ev == d0_ev) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d1_val_t == d1_val)) && !(b1_val_t == 0)) && d0_req_up == 1) && z_val == 0) && !(d0_val_t == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && 1 == b1_req_up - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && d1_ev == 1) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && \result == 1) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 1) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && \result == 0) && !(b0_req_up == 1)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(b0_val == 0)) && z_ev == 2) && !(comp_m1_i == 1)) && !(d0_ev == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_ev == 1) && !(b0_req_up == 1) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && d1_ev == 0) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1))) || (((((((((((((((((((((!(comp_m1_st == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(0 == s3)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && z_req_up == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && !(d0_ev == 1)) && !(b0_val == 0)) && tmp == 0) && z_ev == 2) && \result == 0) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && __retres1 == 0) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && __retres1 == 0) && tmp == 0) && \result == 0) && !(b0_req_up == 1)) || (((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(b0_ev == 0)) && comp_m1_st == 0) && !(d0_ev == 1)) && !(b0_val == 0)) && z_ev == 2) && !(b0_ev == 1)) && !(comp_m1_i == 1)) && z_ev == d1_ev) && !(d0_ev == 0)) && !(b1_ev == 1)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(b1_ev == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-23 13:48:09,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_213a11a9-6d68-4cfc-87fb-d79a0cf11e31/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE