/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 21:37:13,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 21:37:13,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 21:37:13,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 21:37:13,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 21:37:13,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 21:37:13,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 21:37:13,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 21:37:13,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 21:37:13,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 21:37:13,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 21:37:13,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 21:37:13,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 21:37:13,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 21:37:13,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 21:37:13,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 21:37:13,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 21:37:13,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 21:37:13,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 21:37:13,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 21:37:13,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 21:37:13,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 21:37:13,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 21:37:13,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 21:37:13,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 21:37:13,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 21:37:13,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 21:37:13,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 21:37:13,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 21:37:13,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 21:37:13,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 21:37:13,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 21:37:13,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 21:37:13,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 21:37:13,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 21:37:13,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 21:37:13,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 21:37:13,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 21:37:13,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 21:37:13,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 21:37:13,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 21:37:13,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 21:37:13,751 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 21:37:13,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 21:37:13,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 21:37:13,754 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 21:37:13,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 21:37:13,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 21:37:13,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 21:37:13,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 21:37:13,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 21:37:13,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 21:37:13,756 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 21:37:13,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 21:37:13,756 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 21:37:13,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 21:37:13,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 21:37:13,757 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 21:37:13,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 21:37:13,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 21:37:13,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 21:37:13,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 21:37:13,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 21:37:13,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 21:37:13,759 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-21 21:37:14,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 21:37:14,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 21:37:14,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 21:37:14,262 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 21:37:14,264 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 21:37:14,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2021-02-21 21:37:14,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebd7beb/a1dea435217d433f9215d086c2df35ec/FLAG5876f4548 [2021-02-21 21:37:15,159 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 21:37:15,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2021-02-21 21:37:15,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebd7beb/a1dea435217d433f9215d086c2df35ec/FLAG5876f4548 [2021-02-21 21:37:15,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebd7beb/a1dea435217d433f9215d086c2df35ec [2021-02-21 21:37:15,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 21:37:15,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 21:37:15,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 21:37:15,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 21:37:15,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 21:37:15,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fcd1c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15, skipping insertion in model container [2021-02-21 21:37:15,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 21:37:15,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 21:37:15,718 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c[366,379] [2021-02-21 21:37:15,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 21:37:15,802 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 21:37:15,823 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c[366,379] [2021-02-21 21:37:15,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 21:37:15,892 INFO L208 MainTranslator]: Completed translation [2021-02-21 21:37:15,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15 WrapperNode [2021-02-21 21:37:15,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 21:37:15,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 21:37:15,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 21:37:15,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 21:37:15,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... [2021-02-21 21:37:15,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 21:37:15,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 21:37:15,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 21:37:15,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 21:37:16,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 21:37:16,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 21:37:16,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 21:37:16,171 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 21:37:16,171 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-21 21:37:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2021-02-21 21:37:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2021-02-21 21:37:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2021-02-21 21:37:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2021-02-21 21:37:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-21 21:37:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-21 21:37:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-21 21:37:16,174 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-21 21:37:16,174 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-21 21:37:16,174 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-21 21:37:16,174 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-21 21:37:16,175 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-02-21 21:37:16,175 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2021-02-21 21:37:16,175 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2021-02-21 21:37:16,175 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-21 21:37:16,176 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-21 21:37:16,176 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-21 21:37:16,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 21:37:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 21:37:16,176 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 21:37:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 21:37:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 21:37:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-21 21:37:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2021-02-21 21:37:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2021-02-21 21:37:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-02-21 21:37:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 21:37:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure master [2021-02-21 21:37:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2021-02-21 21:37:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-21 21:37:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-21 21:37:16,179 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-21 21:37:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-21 21:37:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-21 21:37:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-21 21:37:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-21 21:37:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2021-02-21 21:37:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2021-02-21 21:37:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-21 21:37:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-21 21:37:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-21 21:37:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 21:37:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 21:37:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 21:37:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 21:37:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 21:37:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 21:37:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 21:37:17,365 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 21:37:17,366 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-21 21:37:17,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 09:37:17 BoogieIcfgContainer [2021-02-21 21:37:17,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 21:37:17,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 21:37:17,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 21:37:17,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 21:37:17,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 09:37:15" (1/3) ... [2021-02-21 21:37:17,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e94839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 09:37:17, skipping insertion in model container [2021-02-21 21:37:17,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:37:15" (2/3) ... [2021-02-21 21:37:17,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e94839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 09:37:17, skipping insertion in model container [2021-02-21 21:37:17,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 09:37:17" (3/3) ... [2021-02-21 21:37:17,389 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-02-21 21:37:17,399 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 21:37:17,406 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 21:37:17,437 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 21:37:17,476 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 21:37:17,477 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 21:37:17,477 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 21:37:17,477 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 21:37:17,477 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 21:37:17,477 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 21:37:17,478 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 21:37:17,478 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 21:37:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2021-02-21 21:37:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-02-21 21:37:17,554 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:17,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:37:17,557 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1623549773, now seen corresponding path program 1 times [2021-02-21 21:37:17,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:17,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349051634] [2021-02-21 21:37:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:17,676 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:18,130 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:18,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:18,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:18,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:18,140 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,141 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,296 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-02-21 21:37:18,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,343 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,344 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,346 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,347 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:18,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,395 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,478 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,479 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,497 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,504 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,505 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,512 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,513 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,525 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:18,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:18,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:37:18,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349051634] [2021-02-21 21:37:18,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:18,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-21 21:37:18,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304555425] [2021-02-21 21:37:18,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-21 21:37:18,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-21 21:37:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-02-21 21:37:18,650 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 7 states. [2021-02-21 21:37:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:21,687 INFO L93 Difference]: Finished difference Result 782 states and 1043 transitions. [2021-02-21 21:37:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-21 21:37:21,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2021-02-21 21:37:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:21,715 INFO L225 Difference]: With dead ends: 782 [2021-02-21 21:37:21,716 INFO L226 Difference]: Without dead ends: 580 [2021-02-21 21:37:21,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-02-21 21:37:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-02-21 21:37:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 399. [2021-02-21 21:37:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2021-02-21 21:37:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 483 transitions. [2021-02-21 21:37:22,090 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 483 transitions. Word has length 115 [2021-02-21 21:37:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:37:22,093 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 483 transitions. [2021-02-21 21:37:22,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-21 21:37:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 483 transitions. [2021-02-21 21:37:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-02-21 21:37:22,113 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:22,114 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:37:22,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 21:37:22,115 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash 686750457, now seen corresponding path program 1 times [2021-02-21 21:37:22,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:22,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989687221] [2021-02-21 21:37:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:22,138 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,322 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,323 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,328 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,329 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,329 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,330 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,331 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,331 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,332 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,333 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,443 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-02-21 21:37:22,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,461 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,479 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,482 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,483 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,505 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,533 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,575 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,583 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,595 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,596 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,603 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,604 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-21 21:37:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,683 WARN L141 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-02-21 21:37:22,685 WARN L147 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size 14 [2021-02-21 21:37:22,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:37:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,728 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,730 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:37:22,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,753 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:22,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-02-21 21:37:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:22,785 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:22,786 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-02-21 21:37:22,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989687221] [2021-02-21 21:37:22,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:22,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 21:37:22,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938229177] [2021-02-21 21:37:22,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 21:37:22,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 21:37:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-02-21 21:37:22,881 INFO L87 Difference]: Start difference. First operand 399 states and 483 transitions. Second operand 10 states. [2021-02-21 21:37:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:26,395 INFO L93 Difference]: Finished difference Result 1534 states and 2102 transitions. [2021-02-21 21:37:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-21 21:37:26,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2021-02-21 21:37:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:26,417 INFO L225 Difference]: With dead ends: 1534 [2021-02-21 21:37:26,417 INFO L226 Difference]: Without dead ends: 1183 [2021-02-21 21:37:26,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2021-02-21 21:37:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-02-21 21:37:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 762. [2021-02-21 21:37:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2021-02-21 21:37:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 960 transitions. [2021-02-21 21:37:26,711 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 960 transitions. Word has length 178 [2021-02-21 21:37:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:37:26,712 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 960 transitions. [2021-02-21 21:37:26,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 21:37:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 960 transitions. [2021-02-21 21:37:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-02-21 21:37:26,717 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:26,718 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:37:26,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 21:37:26,718 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash -729428327, now seen corresponding path program 1 times [2021-02-21 21:37:26,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:26,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846174439] [2021-02-21 21:37:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:26,724 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,764 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:26,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,839 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,840 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,856 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,857 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:37:26,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,882 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,883 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:37:26,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,914 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,923 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:26,941 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:26,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:26,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-21 21:37:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:27,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:27,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:27,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:37:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:27,016 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:27,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:27,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:27,032 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:27,033 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:27,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:27,040 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:27,043 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:27,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:27,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:27,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:27,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-02-21 21:37:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:27,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:27,070 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-02-21 21:37:27,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846174439] [2021-02-21 21:37:27,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:27,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 21:37:27,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856752406] [2021-02-21 21:37:27,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 21:37:27,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 21:37:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-21 21:37:27,122 INFO L87 Difference]: Start difference. First operand 762 states and 960 transitions. Second operand 9 states. [2021-02-21 21:37:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:29,530 INFO L93 Difference]: Finished difference Result 1786 states and 2317 transitions. [2021-02-21 21:37:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-21 21:37:29,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2021-02-21 21:37:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:29,544 INFO L225 Difference]: With dead ends: 1786 [2021-02-21 21:37:29,544 INFO L226 Difference]: Without dead ends: 1070 [2021-02-21 21:37:29,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-02-21 21:37:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-02-21 21:37:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 756. [2021-02-21 21:37:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2021-02-21 21:37:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 949 transitions. [2021-02-21 21:37:29,770 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 949 transitions. Word has length 178 [2021-02-21 21:37:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:37:29,772 INFO L480 AbstractCegarLoop]: Abstraction has 756 states and 949 transitions. [2021-02-21 21:37:29,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 21:37:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 949 transitions. [2021-02-21 21:37:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-02-21 21:37:29,781 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:29,782 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:37:29,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 21:37:29,783 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1363211102, now seen corresponding path program 1 times [2021-02-21 21:37:29,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:29,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727609033] [2021-02-21 21:37:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:29,788 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:29,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:29,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:29,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:29,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,873 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:29,874 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:37:29,880 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,881 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:29,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:29,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:29,962 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:37:29,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:29,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:29,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:29,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:29,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:29,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,030 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,039 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,044 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,060 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,061 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,065 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-21 21:37:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,111 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,111 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:30,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:37:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,142 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,143 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-21 21:37:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:30,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:30,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:30,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-02-21 21:37:30,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727609033] [2021-02-21 21:37:30,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:30,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 21:37:30,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637092849] [2021-02-21 21:37:30,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 21:37:30,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 21:37:30,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-21 21:37:30,321 INFO L87 Difference]: Start difference. First operand 756 states and 949 transitions. Second operand 11 states. [2021-02-21 21:37:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:38,575 INFO L93 Difference]: Finished difference Result 4457 states and 6049 transitions. [2021-02-21 21:37:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-02-21 21:37:38,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2021-02-21 21:37:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:38,624 INFO L225 Difference]: With dead ends: 4457 [2021-02-21 21:37:38,625 INFO L226 Difference]: Without dead ends: 3746 [2021-02-21 21:37:38,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2021-02-21 21:37:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2021-02-21 21:37:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 2959. [2021-02-21 21:37:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2021-02-21 21:37:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3738 transitions. [2021-02-21 21:37:39,322 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3738 transitions. Word has length 183 [2021-02-21 21:37:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:37:39,323 INFO L480 AbstractCegarLoop]: Abstraction has 2959 states and 3738 transitions. [2021-02-21 21:37:39,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 21:37:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3738 transitions. [2021-02-21 21:37:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-02-21 21:37:39,333 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:39,334 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:37:39,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 21:37:39,335 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash 289955978, now seen corresponding path program 1 times [2021-02-21 21:37:39,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:39,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271084834] [2021-02-21 21:37:39,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:39,340 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,400 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,401 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,475 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,476 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,523 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,523 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,558 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,559 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,564 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,565 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,568 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,569 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,578 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-21 21:37:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,614 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,615 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:37:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,626 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,627 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,639 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,641 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,642 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:37:39,655 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-21 21:37:39,656 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-21 21:37:39,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,679 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:37:39,694 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:37:39,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:37:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-02-21 21:37:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:37:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:37:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,783 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,784 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-02-21 21:37:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:39,794 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:39,795 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-02-21 21:37:39,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271084834] [2021-02-21 21:37:39,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:39,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 21:37:39,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896767030] [2021-02-21 21:37:39,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 21:37:39,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 21:37:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-21 21:37:39,896 INFO L87 Difference]: Start difference. First operand 2959 states and 3738 transitions. Second operand 12 states. [2021-02-21 21:37:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:43,776 INFO L93 Difference]: Finished difference Result 6447 states and 8413 transitions. [2021-02-21 21:37:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-21 21:37:43,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2021-02-21 21:37:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:43,803 INFO L225 Difference]: With dead ends: 6447 [2021-02-21 21:37:43,804 INFO L226 Difference]: Without dead ends: 3223 [2021-02-21 21:37:43,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2021-02-21 21:37:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2021-02-21 21:37:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2413. [2021-02-21 21:37:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2021-02-21 21:37:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 2983 transitions. [2021-02-21 21:37:44,438 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 2983 transitions. Word has length 227 [2021-02-21 21:37:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:37:44,440 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 2983 transitions. [2021-02-21 21:37:44,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 21:37:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2983 transitions. [2021-02-21 21:37:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-02-21 21:37:44,447 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:44,448 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:37:44,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 21:37:44,449 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:44,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1002674610, now seen corresponding path program 1 times [2021-02-21 21:37:44,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:44,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1789304878] [2021-02-21 21:37:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:44,455 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,522 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:44,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:44,529 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,530 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:44,531 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,532 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:44,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,533 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,603 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,603 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,604 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,604 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:44,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,617 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,621 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,621 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,635 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,636 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,655 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,662 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,675 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,679 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-21 21:37:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,709 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:37:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,727 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-21 21:37:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:44,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,770 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:37:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,778 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:37:44,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,795 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,796 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,797 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:37:44,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,801 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:37:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:37:44,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-02-21 21:37:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:44,814 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:44,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:37:44,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1789304878] [2021-02-21 21:37:44,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:44,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 21:37:44,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589213218] [2021-02-21 21:37:44,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 21:37:44,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 21:37:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-02-21 21:37:44,883 INFO L87 Difference]: Start difference. First operand 2413 states and 2983 transitions. Second operand 11 states. [2021-02-21 21:37:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:49,024 INFO L93 Difference]: Finished difference Result 6904 states and 8959 transitions. [2021-02-21 21:37:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-02-21 21:37:49,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2021-02-21 21:37:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:49,064 INFO L225 Difference]: With dead ends: 6904 [2021-02-21 21:37:49,064 INFO L226 Difference]: Without dead ends: 4536 [2021-02-21 21:37:49,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2021-02-21 21:37:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2021-02-21 21:37:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3623. [2021-02-21 21:37:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2021-02-21 21:37:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4393 transitions. [2021-02-21 21:37:50,347 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4393 transitions. Word has length 227 [2021-02-21 21:37:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:37:50,348 INFO L480 AbstractCegarLoop]: Abstraction has 3623 states and 4393 transitions. [2021-02-21 21:37:50,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 21:37:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4393 transitions. [2021-02-21 21:37:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-02-21 21:37:50,362 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:37:50,363 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:37:50,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 21:37:50,363 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:37:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:37:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -886783072, now seen corresponding path program 1 times [2021-02-21 21:37:50,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:37:50,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012246284] [2021-02-21 21:37:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:37:50,375 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:37:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,462 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,462 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:50,465 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,466 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:50,467 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:50,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,468 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,469 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,469 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:37:50,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,549 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,550 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,550 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,551 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:37:50,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:37:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,565 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,566 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:37:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:37:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,585 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:37:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,606 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:37:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,615 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,619 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,619 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:37:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,624 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,624 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:37:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,629 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,630 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-21 21:37:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,660 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:37:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,667 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,673 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,676 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,677 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:37:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-21 21:37:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,712 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:50,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-02-21 21:37:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,727 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,728 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,728 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:37:50,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-02-21 21:37:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:37:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,753 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:37:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,758 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,759 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:37:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:37:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-02-21 21:37:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:37:50,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:37:50,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:37:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:37:50,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012246284] [2021-02-21 21:37:50,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:37:50,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 21:37:50,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609845326] [2021-02-21 21:37:50,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 21:37:50,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:37:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 21:37:50,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-02-21 21:37:50,930 INFO L87 Difference]: Start difference. First operand 3623 states and 4393 transitions. Second operand 12 states. [2021-02-21 21:37:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:37:59,142 INFO L93 Difference]: Finished difference Result 7008 states and 8626 transitions. [2021-02-21 21:37:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-02-21 21:37:59,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 256 [2021-02-21 21:37:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:37:59,183 INFO L225 Difference]: With dead ends: 7008 [2021-02-21 21:37:59,183 INFO L226 Difference]: Without dead ends: 4569 [2021-02-21 21:37:59,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2021-02-21 21:37:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2021-02-21 21:38:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 3665. [2021-02-21 21:38:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2021-02-21 21:38:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4341 transitions. [2021-02-21 21:38:00,133 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4341 transitions. Word has length 256 [2021-02-21 21:38:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:00,134 INFO L480 AbstractCegarLoop]: Abstraction has 3665 states and 4341 transitions. [2021-02-21 21:38:00,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 21:38:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4341 transitions. [2021-02-21 21:38:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-21 21:38:00,144 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:00,144 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:38:00,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 21:38:00,145 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash -429549839, now seen corresponding path program 1 times [2021-02-21 21:38:00,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:00,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614156627] [2021-02-21 21:38:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:00,149 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,205 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,211 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,212 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,212 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:00,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,218 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,286 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,287 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:38:00,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,303 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,305 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,353 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,353 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,372 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,372 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,376 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,378 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,379 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,382 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,383 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:38:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-21 21:38:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,409 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-21 21:38:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,412 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-21 21:38:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,452 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,454 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,486 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,487 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,491 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,492 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-21 21:38:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,510 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,511 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:00,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:38:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,589 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,590 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,594 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,596 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,603 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,604 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,605 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,605 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,621 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,622 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:00,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-02-21 21:38:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:00,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:00,646 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:38:00,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614156627] [2021-02-21 21:38:00,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:00,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-21 21:38:00,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421357857] [2021-02-21 21:38:00,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-21 21:38:00,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-21 21:38:00,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-02-21 21:38:00,750 INFO L87 Difference]: Start difference. First operand 3665 states and 4341 transitions. Second operand 17 states. [2021-02-21 21:38:02,520 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-02-21 21:38:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:11,702 INFO L93 Difference]: Finished difference Result 8410 states and 10544 transitions. [2021-02-21 21:38:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-02-21 21:38:11,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 262 [2021-02-21 21:38:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:11,737 INFO L225 Difference]: With dead ends: 8410 [2021-02-21 21:38:11,738 INFO L226 Difference]: Without dead ends: 4789 [2021-02-21 21:38:11,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2021-02-21 21:38:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2021-02-21 21:38:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 3673. [2021-02-21 21:38:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2021-02-21 21:38:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4248 transitions. [2021-02-21 21:38:12,500 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4248 transitions. Word has length 262 [2021-02-21 21:38:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:12,501 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4248 transitions. [2021-02-21 21:38:12,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-21 21:38:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4248 transitions. [2021-02-21 21:38:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-21 21:38:12,507 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:12,508 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:38:12,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 21:38:12,508 INFO L428 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1900844140, now seen corresponding path program 1 times [2021-02-21 21:38:12,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:12,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227147718] [2021-02-21 21:38:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:12,512 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,574 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,575 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:38:12,581 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 21:38:12,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:38:12,595 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,596 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,671 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,671 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,684 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,684 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,701 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,701 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,708 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,708 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,714 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-21 21:38:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,716 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-21 21:38:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,740 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,741 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-21 21:38:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,743 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,743 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-21 21:38:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,778 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:38:12,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,786 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,786 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,791 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,793 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,796 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-21 21:38:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,813 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,814 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:12,825 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,826 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 21:38:12,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:38:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,847 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,848 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,852 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,852 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,857 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-02-21 21:38:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:12,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:12,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:38:12,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227147718] [2021-02-21 21:38:12,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:12,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 21:38:12,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772997379] [2021-02-21 21:38:12,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 21:38:12,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 21:38:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-02-21 21:38:12,950 INFO L87 Difference]: Start difference. First operand 3673 states and 4248 transitions. Second operand 12 states. [2021-02-21 21:38:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:20,782 INFO L93 Difference]: Finished difference Result 10320 states and 12285 transitions. [2021-02-21 21:38:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-02-21 21:38:20,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2021-02-21 21:38:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:20,825 INFO L225 Difference]: With dead ends: 10320 [2021-02-21 21:38:20,825 INFO L226 Difference]: Without dead ends: 7589 [2021-02-21 21:38:20,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2021-02-21 21:38:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7589 states. [2021-02-21 21:38:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7589 to 6220. [2021-02-21 21:38:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2021-02-21 21:38:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 7325 transitions. [2021-02-21 21:38:22,140 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 7325 transitions. Word has length 262 [2021-02-21 21:38:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:22,140 INFO L480 AbstractCegarLoop]: Abstraction has 6220 states and 7325 transitions. [2021-02-21 21:38:22,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 21:38:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 7325 transitions. [2021-02-21 21:38:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-02-21 21:38:22,149 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:22,150 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:38:22,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 21:38:22,150 INFO L428 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash -758707222, now seen corresponding path program 1 times [2021-02-21 21:38:22,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:22,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162948081] [2021-02-21 21:38:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:22,154 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:22,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:22,200 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:22,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,202 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,202 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,203 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,272 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,273 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:22,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,286 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,287 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,318 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,319 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,323 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,325 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,325 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,327 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,328 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,330 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,331 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,364 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,364 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,365 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,365 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,366 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,366 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:22,373 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,374 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:22,382 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,384 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-21 21:38:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,418 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,419 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,424 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,428 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,428 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,430 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,432 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-21 21:38:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,439 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,440 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:22,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,449 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:22,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-02-21 21:38:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,467 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,468 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-02-21 21:38:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,470 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-02-21 21:38:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,477 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,478 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,482 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,484 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,485 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-02-21 21:38:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-02-21 21:38:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-02-21 21:38:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,497 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-02-21 21:38:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:22,499 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:22,499 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-02-21 21:38:22,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162948081] [2021-02-21 21:38:22,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:22,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-21 21:38:22,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808166495] [2021-02-21 21:38:22,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-21 21:38:22,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-21 21:38:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-21 21:38:22,548 INFO L87 Difference]: Start difference. First operand 6220 states and 7325 transitions. Second operand 13 states. [2021-02-21 21:38:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:27,214 INFO L93 Difference]: Finished difference Result 10838 states and 12762 transitions. [2021-02-21 21:38:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-21 21:38:27,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 283 [2021-02-21 21:38:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:27,237 INFO L225 Difference]: With dead ends: 10838 [2021-02-21 21:38:27,238 INFO L226 Difference]: Without dead ends: 4664 [2021-02-21 21:38:27,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2021-02-21 21:38:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2021-02-21 21:38:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 3928. [2021-02-21 21:38:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2021-02-21 21:38:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 4551 transitions. [2021-02-21 21:38:27,950 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 4551 transitions. Word has length 283 [2021-02-21 21:38:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:27,950 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 4551 transitions. [2021-02-21 21:38:27,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-21 21:38:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 4551 transitions. [2021-02-21 21:38:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2021-02-21 21:38:27,955 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:27,956 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:38:27,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-21 21:38:27,956 INFO L428 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:27,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1388894635, now seen corresponding path program 1 times [2021-02-21 21:38:27,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:27,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446643971] [2021-02-21 21:38:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:27,960 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,006 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,006 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,006 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,007 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:28,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:28,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:28,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,138 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:38:28,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,157 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,163 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,168 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:28,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,222 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,223 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,235 WARN L141 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size [2021-02-21 21:38:28,236 WARN L147 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size 7 [2021-02-21 21:38:28,251 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,251 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,252 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,253 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-21 21:38:28,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-21 21:38:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,312 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,312 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,316 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,317 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,323 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,325 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,326 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-21 21:38:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,356 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,356 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-21 21:38:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-21 21:38:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,372 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,373 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-21 21:38:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:28,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-21 21:38:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,382 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,383 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,384 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:38:28,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,398 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:38:28,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,401 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-02-21 21:38:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,406 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-02-21 21:38:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,409 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-02-21 21:38:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,412 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,415 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-02-21 21:38:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:28,418 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:28,418 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-02-21 21:38:28,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446643971] [2021-02-21 21:38:28,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:28,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-21 21:38:28,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975530437] [2021-02-21 21:38:28,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-21 21:38:28,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-21 21:38:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-02-21 21:38:28,512 INFO L87 Difference]: Start difference. First operand 3928 states and 4551 transitions. Second operand 17 states. [2021-02-21 21:38:28,899 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2021-02-21 21:38:29,882 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-02-21 21:38:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:37,698 INFO L93 Difference]: Finished difference Result 10083 states and 12373 transitions. [2021-02-21 21:38:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-02-21 21:38:37,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 292 [2021-02-21 21:38:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:37,749 INFO L225 Difference]: With dead ends: 10083 [2021-02-21 21:38:37,749 INFO L226 Difference]: Without dead ends: 6205 [2021-02-21 21:38:37,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1306, Invalid=5336, Unknown=0, NotChecked=0, Total=6642 [2021-02-21 21:38:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6205 states. [2021-02-21 21:38:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6205 to 4919. [2021-02-21 21:38:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4919 states. [2021-02-21 21:38:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 5548 transitions. [2021-02-21 21:38:39,320 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 5548 transitions. Word has length 292 [2021-02-21 21:38:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:39,324 INFO L480 AbstractCegarLoop]: Abstraction has 4919 states and 5548 transitions. [2021-02-21 21:38:39,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-21 21:38:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 5548 transitions. [2021-02-21 21:38:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2021-02-21 21:38:39,336 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:39,337 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 21:38:39,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-21 21:38:39,337 INFO L428 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:39,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2026275409, now seen corresponding path program 1 times [2021-02-21 21:38:39,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:39,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047726862] [2021-02-21 21:38:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:39,345 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,473 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,482 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,484 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,485 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,522 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,522 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,525 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,529 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,530 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,544 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,545 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,587 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,588 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,588 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,589 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:39,595 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,595 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,598 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 21:38:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,617 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,618 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-21 21:38:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,620 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,620 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:38:39,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,653 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,653 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,660 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,663 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-02-21 21:38:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,674 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,676 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:39,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:38:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,691 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:38:39,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,700 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:38:39,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,707 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 21:38:39,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-02-21 21:38:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-02-21 21:38:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,753 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-02-21 21:38:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,757 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-02-21 21:38:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,768 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,768 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-02-21 21:38:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,771 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,772 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-02-21 21:38:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-02-21 21:38:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,777 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,778 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-21 21:38:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,783 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-02-21 21:38:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,789 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,789 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:38:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,793 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,794 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,798 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,801 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,802 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,804 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-02-21 21:38:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:39,809 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:39,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-02-21 21:38:39,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047726862] [2021-02-21 21:38:39,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:39,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 21:38:39,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010388694] [2021-02-21 21:38:39,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 21:38:39,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:39,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 21:38:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-02-21 21:38:39,944 INFO L87 Difference]: Start difference. First operand 4919 states and 5548 transitions. Second operand 11 states. [2021-02-21 21:38:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:43,193 INFO L93 Difference]: Finished difference Result 9577 states and 11061 transitions. [2021-02-21 21:38:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-21 21:38:43,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 427 [2021-02-21 21:38:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:43,213 INFO L225 Difference]: With dead ends: 9577 [2021-02-21 21:38:43,213 INFO L226 Difference]: Without dead ends: 4878 [2021-02-21 21:38:43,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2021-02-21 21:38:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-02-21 21:38:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4497. [2021-02-21 21:38:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4497 states. [2021-02-21 21:38:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 5019 transitions. [2021-02-21 21:38:44,402 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 5019 transitions. Word has length 427 [2021-02-21 21:38:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:44,403 INFO L480 AbstractCegarLoop]: Abstraction has 4497 states and 5019 transitions. [2021-02-21 21:38:44,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 21:38:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 5019 transitions. [2021-02-21 21:38:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-02-21 21:38:44,414 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:44,414 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:38:44,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-21 21:38:44,415 INFO L428 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 579786324, now seen corresponding path program 1 times [2021-02-21 21:38:44,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:44,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [773605601] [2021-02-21 21:38:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:44,419 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,482 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,483 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,486 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,487 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,489 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,489 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,492 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,559 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,560 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,560 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,561 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,609 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,609 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,697 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,705 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,749 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,750 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,751 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 21:38:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-21 21:38:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,776 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,776 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,821 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,823 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,824 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-02-21 21:38:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:44,840 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,840 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:38:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,847 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,847 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,873 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,890 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,891 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:44,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,905 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,905 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-21 21:38:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-02-21 21:38:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-02-21 21:38:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-02-21 21:38:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,943 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,945 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,946 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,951 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-02-21 21:38:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,955 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-02-21 21:38:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,957 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-02-21 21:38:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,961 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-02-21 21:38:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-02-21 21:38:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,976 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 21:38:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,980 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,981 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,986 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:44,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2021-02-21 21:38:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:44,996 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:44,997 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-02-21 21:38:45,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [773605601] [2021-02-21 21:38:45,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:45,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-21 21:38:45,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569228095] [2021-02-21 21:38:45,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-21 21:38:45,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:45,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-21 21:38:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-02-21 21:38:45,113 INFO L87 Difference]: Start difference. First operand 4497 states and 5019 transitions. Second operand 15 states. [2021-02-21 21:38:48,153 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-02-21 21:38:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:49,503 INFO L93 Difference]: Finished difference Result 6016 states and 6733 transitions. [2021-02-21 21:38:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-02-21 21:38:49,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 429 [2021-02-21 21:38:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:49,511 INFO L225 Difference]: With dead ends: 6016 [2021-02-21 21:38:49,511 INFO L226 Difference]: Without dead ends: 1789 [2021-02-21 21:38:49,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2021-02-21 21:38:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2021-02-21 21:38:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1587. [2021-02-21 21:38:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2021-02-21 21:38:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1722 transitions. [2021-02-21 21:38:49,946 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1722 transitions. Word has length 429 [2021-02-21 21:38:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:49,947 INFO L480 AbstractCegarLoop]: Abstraction has 1587 states and 1722 transitions. [2021-02-21 21:38:49,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-21 21:38:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1722 transitions. [2021-02-21 21:38:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-02-21 21:38:49,954 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:49,955 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:38:49,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-21 21:38:49,955 INFO L428 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1823099586, now seen corresponding path program 1 times [2021-02-21 21:38:49,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:49,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342485450] [2021-02-21 21:38:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:49,960 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:50,027 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,105 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,133 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,138 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,140 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,140 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,143 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,143 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,174 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,176 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-21 21:38:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,201 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,205 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,211 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,214 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-21 21:38:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,238 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-21 21:38:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,240 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-21 21:38:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,249 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-21 21:38:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,252 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,252 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-21 21:38:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,256 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,258 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-21 21:38:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-21 21:38:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,266 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,267 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-21 21:38:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:38:50,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-21 21:38:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,284 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,284 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,292 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-21 21:38:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,298 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:50,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-02-21 21:38:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,309 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,310 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,311 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,312 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-02-21 21:38:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,316 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,316 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,318 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,318 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2021-02-21 21:38:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-02-21 21:38:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,325 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,326 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-02-21 21:38:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,330 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,330 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,332 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,333 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,334 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-02-21 21:38:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,338 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2021-02-21 21:38:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,341 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,341 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2021-02-21 21:38:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,344 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,345 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,347 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,347 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2021-02-21 21:38:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:50,349 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:50,350 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-02-21 21:38:50,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342485450] [2021-02-21 21:38:50,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:50,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 21:38:50,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554913940] [2021-02-21 21:38:50,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 21:38:50,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 21:38:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-02-21 21:38:50,538 INFO L87 Difference]: Start difference. First operand 1587 states and 1722 transitions. Second operand 12 states. [2021-02-21 21:38:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:53,550 INFO L93 Difference]: Finished difference Result 2871 states and 3123 transitions. [2021-02-21 21:38:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-02-21 21:38:53,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 437 [2021-02-21 21:38:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:53,556 INFO L225 Difference]: With dead ends: 2871 [2021-02-21 21:38:53,557 INFO L226 Difference]: Without dead ends: 1554 [2021-02-21 21:38:53,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2021-02-21 21:38:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-02-21 21:38:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1451. [2021-02-21 21:38:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2021-02-21 21:38:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1558 transitions. [2021-02-21 21:38:53,962 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1558 transitions. Word has length 437 [2021-02-21 21:38:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:53,963 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 1558 transitions. [2021-02-21 21:38:53,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 21:38:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1558 transitions. [2021-02-21 21:38:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-02-21 21:38:53,968 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:53,969 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:38:53,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-21 21:38:53,969 INFO L428 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1496415247, now seen corresponding path program 1 times [2021-02-21 21:38:53,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:53,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526389394] [2021-02-21 21:38:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:53,974 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,080 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,080 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,090 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,102 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,129 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-21 21:38:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,204 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,207 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,207 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-21 21:38:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,233 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,234 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-21 21:38:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,236 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,237 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-21 21:38:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,245 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,246 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-21 21:38:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,249 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-21 21:38:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,253 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,256 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,259 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-21 21:38:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,263 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-21 21:38:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,266 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,266 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-21 21:38:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,276 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-21 21:38:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,280 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,281 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,283 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,283 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-21 21:38:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,291 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-02-21 21:38:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,298 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,299 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:38:54,310 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-21 21:38:54,311 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-21 21:38:54,321 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,326 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,327 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,327 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,328 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:38:54,341 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,342 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 21:38:54,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-02-21 21:38:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,358 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,359 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,361 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,361 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-02-21 21:38:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,363 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-02-21 21:38:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,366 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,366 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-21 21:38:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,370 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,372 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,373 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,375 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-02-21 21:38:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,378 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,379 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-02-21 21:38:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-02-21 21:38:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,384 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-02-21 21:38:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:54,389 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:54,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-02-21 21:38:54,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526389394] [2021-02-21 21:38:54,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:54,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-02-21 21:38:54,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129723094] [2021-02-21 21:38:54,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-02-21 21:38:54,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-02-21 21:38:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-02-21 21:38:54,500 INFO L87 Difference]: Start difference. First operand 1451 states and 1558 transitions. Second operand 14 states. [2021-02-21 21:38:55,958 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-02-21 21:38:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:38:57,280 INFO L93 Difference]: Finished difference Result 2745 states and 2966 transitions. [2021-02-21 21:38:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-21 21:38:57,281 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 438 [2021-02-21 21:38:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:38:57,285 INFO L225 Difference]: With dead ends: 2745 [2021-02-21 21:38:57,286 INFO L226 Difference]: Without dead ends: 1564 [2021-02-21 21:38:57,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2021-02-21 21:38:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2021-02-21 21:38:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1448. [2021-02-21 21:38:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2021-02-21 21:38:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1552 transitions. [2021-02-21 21:38:57,569 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1552 transitions. Word has length 438 [2021-02-21 21:38:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:38:57,570 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 1552 transitions. [2021-02-21 21:38:57,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-02-21 21:38:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1552 transitions. [2021-02-21 21:38:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-02-21 21:38:57,574 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:38:57,574 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 21:38:57,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-02-21 21:38:57,575 INFO L428 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:38:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:38:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1033013137, now seen corresponding path program 1 times [2021-02-21 21:38:57,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:38:57,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2134954681] [2021-02-21 21:38:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:38:57,579 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:38:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:57,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,636 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:57,637 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:57,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,638 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:57,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:38:57,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,714 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,715 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,715 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,716 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:57,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-21 21:38:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,729 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-21 21:38:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,731 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,732 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:38:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,745 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,746 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-21 21:38:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-21 21:38:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,769 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,769 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,776 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,776 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 21:38:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-21 21:38:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,814 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,814 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-21 21:38:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-21 21:38:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,845 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:38:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,849 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,851 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 21:38:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-21 21:38:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,880 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-21 21:38:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,882 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-21 21:38:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-21 21:38:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,899 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-21 21:38:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,905 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,906 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-21 21:38:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,914 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,914 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-21 21:38:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-21 21:38:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,929 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,929 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-21 21:38:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,934 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,934 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-21 21:38:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,939 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-21 21:38:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,943 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-02-21 21:38:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,948 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,948 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:57,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:38:57,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,974 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,974 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-02-21 21:38:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,978 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,980 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,981 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-02-21 21:38:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-02-21 21:38:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,985 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-21 21:38:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,990 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,990 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,993 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 21:38:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:57,995 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:57,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:57,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-02-21 21:38:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:58,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:58,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:58,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-02-21 21:38:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:58,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:58,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:58,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-02-21 21:38:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:58,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:58,006 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:58,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-21 21:38:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:58,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:58,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:58,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-02-21 21:38:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:38:58,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:38:58,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:38:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-02-21 21:38:58,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2134954681] [2021-02-21 21:38:58,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:38:58,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-21 21:38:58,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043865815] [2021-02-21 21:38:58,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-21 21:38:58,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:38:58,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-21 21:38:58,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-02-21 21:38:58,195 INFO L87 Difference]: Start difference. First operand 1448 states and 1552 transitions. Second operand 15 states. [2021-02-21 21:39:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:39:01,360 INFO L93 Difference]: Finished difference Result 2281 states and 2451 transitions. [2021-02-21 21:39:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-02-21 21:39:01,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 438 [2021-02-21 21:39:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:39:01,362 INFO L225 Difference]: With dead ends: 2281 [2021-02-21 21:39:01,362 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 21:39:01,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2021-02-21 21:39:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 21:39:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 21:39:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 21:39:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 21:39:01,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 438 [2021-02-21 21:39:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:39:01,372 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 21:39:01,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-21 21:39:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 21:39:01,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 21:39:01,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-02-21 21:39:01,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 21:39:02,488 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2021-02-21 21:39:02,599 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2021-02-21 21:39:02,893 WARN L202 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2021-02-21 21:39:03,854 WARN L202 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2021-02-21 21:39:04,130 WARN L202 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2021-02-21 21:39:04,404 WARN L202 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 116 [2021-02-21 21:39:05,597 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 119 [2021-02-21 21:39:05,850 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2021-02-21 21:39:06,101 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-02-21 21:39:06,537 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2021-02-21 21:39:10,930 WARN L202 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2021-02-21 21:39:11,053 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2021-02-21 21:39:11,192 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 105 [2021-02-21 21:39:12,493 WARN L202 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 115 [2021-02-21 21:39:15,542 WARN L202 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2021-02-21 21:39:15,733 WARN L202 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2021-02-21 21:39:16,014 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2021-02-21 21:39:17,454 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2021-02-21 21:39:17,757 WARN L202 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2021-02-21 21:39:17,951 WARN L202 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2021-02-21 21:39:18,183 WARN L202 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2021-02-21 21:39:19,033 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2021-02-21 21:39:19,141 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2021-02-21 21:39:22,904 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-02-21 21:39:25,861 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-02-21 21:39:25,981 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-02-21 21:39:29,221 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2021-02-21 21:39:29,520 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2021-02-21 21:39:29,749 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2021-02-21 21:39:29,854 WARN L202 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2021-02-21 21:39:30,400 WARN L202 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-21 21:39:30,518 WARN L202 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-21 21:39:30,784 WARN L202 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-21 21:39:30,921 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-21 21:39:31,098 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-21 21:39:31,223 WARN L202 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-21 21:39:33,115 WARN L202 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-21 21:39:33,232 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-21 21:39:33,501 WARN L202 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-21 21:39:33,632 WARN L202 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-21 21:39:33,807 WARN L202 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-21 21:39:33,925 WARN L202 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-21 21:39:39,068 WARN L202 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-02-21 21:39:39,324 WARN L202 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2021-02-21 21:39:40,648 WARN L202 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-21 21:39:42,086 WARN L202 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 166 DAG size of output: 80 [2021-02-21 21:39:43,110 WARN L202 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2021-02-21 21:39:43,937 WARN L202 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 55 [2021-02-21 21:39:45,094 WARN L202 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 162 DAG size of output: 89 [2021-02-21 21:39:45,349 WARN L202 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 38 [2021-02-21 21:39:47,413 WARN L202 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2021-02-21 21:39:49,464 WARN L202 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2021-02-21 21:39:49,683 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-21 21:39:50,678 WARN L202 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-21 21:39:51,294 WARN L202 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2021-02-21 21:39:51,576 WARN L202 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2021-02-21 21:39:51,746 WARN L202 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2021-02-21 21:39:53,515 WARN L202 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 133 DAG size of output: 70 [2021-02-21 21:39:55,360 WARN L202 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2021-02-21 21:39:55,796 WARN L202 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2021-02-21 21:39:56,043 WARN L202 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2021-02-21 21:39:56,622 WARN L202 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2021-02-21 21:39:56,923 WARN L202 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 38 [2021-02-21 21:39:57,389 WARN L202 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-02-21 21:39:57,580 WARN L202 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-02-21 21:39:57,802 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-21 21:39:57,937 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-21 21:39:58,039 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2021-02-21 21:39:58,267 WARN L202 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-21 21:39:58,417 WARN L202 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-21 21:39:58,653 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2021-02-21 21:39:58,880 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-21 21:39:59,114 WARN L202 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2021-02-21 21:40:00,283 WARN L202 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2021-02-21 21:40:00,700 WARN L202 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2021-02-21 21:40:00,804 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2021-02-21 21:40:01,471 WARN L202 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2021-02-21 21:40:02,215 WARN L202 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2021-02-21 21:40:02,710 WARN L202 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2021-02-21 21:40:02,945 WARN L202 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2021-02-21 21:40:03,342 WARN L202 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-02-21 21:40:04,431 WARN L202 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2021-02-21 21:40:05,684 WARN L202 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 127 DAG size of output: 69 [2021-02-21 21:40:06,196 WARN L202 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2021-02-21 21:40:06,984 WARN L202 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-21 21:40:08,932 WARN L202 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2021-02-21 21:40:09,788 WARN L202 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2021-02-21 21:40:10,422 WARN L202 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-21 21:40:10,963 WARN L202 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-21 21:40:11,181 WARN L202 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2021-02-21 21:40:11,812 WARN L202 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 45 [2021-02-21 21:40:12,216 WARN L202 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2021-02-21 21:40:12,441 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-21 21:40:12,661 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-21 21:40:13,054 WARN L202 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-02-21 21:40:13,275 WARN L202 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-21 21:40:13,915 WARN L202 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 45 [2021-02-21 21:40:15,989 WARN L202 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 188 DAG size of output: 91 [2021-02-21 21:40:17,316 WARN L202 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-21 21:40:17,676 WARN L202 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2021-02-21 21:40:18,791 WARN L202 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 120 DAG size of output: 59 [2021-02-21 21:40:19,930 WARN L202 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2021-02-21 21:40:20,150 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2021-02-21 21:40:21,741 WARN L202 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 149 DAG size of output: 87 [2021-02-21 21:40:23,218 WARN L202 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2021-02-21 21:40:23,638 WARN L202 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2021-02-21 21:40:25,122 WARN L202 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2021-02-21 21:40:25,434 WARN L202 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 40 [2021-02-21 21:40:25,572 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2021-02-21 21:40:26,321 WARN L202 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2021-02-21 21:40:26,445 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-02-21 21:40:26,840 WARN L202 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 47 [2021-02-21 21:40:27,550 WARN L202 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2021-02-21 21:40:27,742 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-02-21 21:40:27,947 WARN L202 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-02-21 21:40:28,085 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-21 21:40:28,220 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-21 21:40:28,587 WARN L202 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-21 21:40:28,950 WARN L202 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2021-02-21 21:40:30,087 WARN L202 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2021-02-21 21:40:30,515 WARN L202 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2021-02-21 21:40:30,878 WARN L202 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2021-02-21 21:40:32,192 WARN L202 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 165 DAG size of output: 82 [2021-02-21 21:40:32,953 WARN L202 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2021-02-21 21:40:33,242 WARN L202 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2021-02-21 21:40:35,193 WARN L202 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2021-02-21 21:40:35,350 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 32 [2021-02-21 21:40:36,141 WARN L202 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-21 21:40:36,973 WARN L202 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2021-02-21 21:40:37,147 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2021-02-21 21:40:37,681 WARN L202 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 51 [2021-02-21 21:40:37,786 WARN L202 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2021-02-21 21:40:37,963 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-02-21 21:40:38,575 WARN L202 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2021-02-21 21:40:38,776 WARN L202 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-02-21 21:40:39,567 WARN L202 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-21 21:40:40,367 WARN L202 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-21 21:40:40,695 WARN L202 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2021-02-21 21:40:42,972 WARN L202 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 174 DAG size of output: 89 [2021-02-21 21:40:43,725 WARN L202 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2021-02-21 21:40:46,495 WARN L202 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 206 DAG size of output: 102 [2021-02-21 21:40:46,733 WARN L202 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-21 21:40:46,920 WARN L202 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-21 21:40:47,342 WARN L202 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2021-02-21 21:40:48,767 WARN L202 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 166 DAG size of output: 80 [2021-02-21 21:40:49,361 WARN L202 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 55 [2021-02-21 21:40:49,793 WARN L202 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2021-02-21 21:40:50,675 WARN L202 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2021-02-21 21:40:51,618 WARN L202 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2021-02-21 21:40:52,364 WARN L202 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2021-02-21 21:40:52,929 WARN L202 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2021-02-21 21:40:54,358 WARN L202 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-21 21:40:54,498 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2021-02-21 21:40:55,104 WARN L202 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2021-02-21 21:40:55,569 WARN L202 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2021-02-21 21:40:55,920 WARN L202 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2021-02-21 21:40:56,107 WARN L202 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-02-21 21:40:56,213 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2021-02-21 21:40:58,980 WARN L202 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 206 DAG size of output: 102 [2021-02-21 21:40:59,165 WARN L202 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-21 21:41:00,045 WARN L202 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2021-02-21 21:41:00,731 WARN L202 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2021-02-21 21:41:01,962 WARN L202 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2021-02-21 21:41:02,519 WARN L202 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-21 21:41:03,320 WARN L202 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-21 21:41:03,667 WARN L202 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2021-02-21 21:41:04,147 WARN L202 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-02-21 21:41:05,700 WARN L202 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-21 21:41:06,128 WARN L202 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2021-02-21 21:41:07,642 WARN L202 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-21 21:41:08,017 WARN L202 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-21 21:41:09,062 WARN L202 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-21 21:41:09,240 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2021-02-21 21:41:09,449 WARN L202 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-02-21 21:41:10,366 WARN L202 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2021-02-21 21:41:10,551 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-21 21:41:10,860 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-21 21:41:11,296 WARN L202 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2021-02-21 21:41:12,309 WARN L202 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2021-02-21 21:41:12,873 WARN L202 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2021-02-21 21:41:13,388 WARN L202 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-02-21 21:41:14,100 WARN L202 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2021-02-21 21:41:14,573 WARN L202 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-02-21 21:41:15,457 WARN L202 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2021-02-21 21:41:16,288 WARN L202 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2021-02-21 21:41:16,473 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-21 21:41:16,636 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-02-21 21:41:17,158 WARN L202 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2021-02-21 21:41:19,382 WARN L202 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2021-02-21 21:41:21,689 WARN L202 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 176 DAG size of output: 91 [2021-02-21 21:41:22,203 WARN L202 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-02-21 21:41:23,805 WARN L202 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-21 21:41:23,969 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-02-21 21:41:24,866 WARN L202 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2021-02-21 21:41:25,907 WARN L202 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-21 21:41:26,955 WARN L202 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-21 21:41:29,297 WARN L202 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2021-02-21 21:41:30,160 WARN L202 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2021-02-21 21:41:31,202 WARN L202 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-21 21:41:31,395 WARN L202 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2021-02-21 21:41:31,851 WARN L202 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2021-02-21 21:41:32,060 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-02-21 21:41:32,557 WARN L202 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-21 21:41:32,872 WARN L202 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2021-02-21 21:41:33,011 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-21 21:41:33,203 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2021-02-21 21:41:35,047 WARN L202 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 158 DAG size of output: 80 [2021-02-21 21:41:35,230 WARN L202 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-21 21:41:35,416 WARN L202 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-21 21:41:36,093 WARN L202 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2021-02-21 21:41:36,967 WARN L202 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 67 [2021-02-21 21:41:37,270 WARN L202 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2021-02-21 21:41:37,433 WARN L202 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2021-02-21 21:41:39,284 WARN L202 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2021-02-21 21:41:39,542 WARN L202 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2021-02-21 21:41:40,623 WARN L202 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2021-02-21 21:41:41,076 WARN L202 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 40 [2021-02-21 21:41:41,334 WARN L202 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2021-02-21 21:41:43,224 WARN L202 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 145 DAG size of output: 83 [2021-02-21 21:41:43,588 WARN L202 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2021-02-21 21:41:44,221 WARN L202 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 42 [2021-02-21 21:41:44,365 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2021-02-21 21:41:44,656 WARN L202 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2021-02-21 21:41:45,141 WARN L202 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-02-21 21:41:45,149 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-21 21:41:45,149 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-21 21:41:45,149 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-21 21:41:45,150 INFO L185 CegarLoopUtils]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2021-02-21 21:41:45,150 INFO L185 CegarLoopUtils]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2021-02-21 21:41:45,150 INFO L185 CegarLoopUtils]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (= ~M_E~0 2))) (.cse11 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse13 (not (= |old(~t1_pc~0)| 0))) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (= ~m_pc~0 1))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~t1_pc~0 0)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (and .cse7 (= ~m_st~0 0) .cse8 .cse2 .cse4) .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse16 .cse9 .cse17 .cse10 .cse12 .cse18 .cse5 .cse19 .cse14) (or .cse15 .cse16 .cse9 .cse17 .cse12 .cse18 .cse5 .cse19 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)) (or .cse15 .cse9 .cse11 .cse12 .cse13 .cse18 .cse5 .cse19 (and .cse1 .cse7 .cse8 .cse2 .cse4) .cse6 .cse14))) [2021-02-21 21:41:45,151 INFO L185 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse17 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (and .cse11 .cse12 .cse13) .cse6 .cse8) (or (let ((.cse14 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) .cse11 (<= .cse14 ~token~0) (<= ~token~0 .cse14) .cse12 .cse13)) (let ((.cse15 (= |old(~E_M~0)| 1)) (.cse16 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse15 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)))) (or .cse10 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse9))) [2021-02-21 21:41:45,151 INFO L185 CegarLoopUtils]: At program point L94(line 94) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse11 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse1 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse7 (= ~t1_pc~0 1)) (.cse17 (or (= ~t1_st~0 0) .cse10)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 (and .cse7 (= ~m_st~0 |old(~m_st~0)|) .cse8 .cse10 .cse11) .cse16 .cse12) (or .cse0 .cse6 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse1 .cse19 .cse2 .cse4 .cse14 .cse6 .cse15 .cse12) (or .cse13 .cse18 .cse1 .cse19 .cse4 .cse14 .cse6 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse7 (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse8 .cse9)))))) [2021-02-21 21:41:45,151 INFO L185 CegarLoopUtils]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2021-02-21 21:41:45,152 INFO L185 CegarLoopUtils]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2021-02-21 21:41:45,152 INFO L185 CegarLoopUtils]: At program point transmit1EXIT(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2021-02-21 21:41:45,152 INFO L185 CegarLoopUtils]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2021-02-21 21:41:45,152 INFO L185 CegarLoopUtils]: At program point L101(line 101) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse9 (not (= |old(~t1_pc~0)| 0))) (.cse13 (not (= |old(~m_st~0)| 0))) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse12) (or .cse0 .cse6 .cse13 .cse7 .cse8 .cse9 .cse3 .cse12) (or (let ((.cse14 (= |old(~E_M~0)| 1)) (.cse15 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse5 .cse14 .cse6 .cse15 .cse13 .cse8 .cse10 .cse3 .cse11 .cse12) (or .cse5 .cse14 .cse6 .cse15 .cse8 .cse10 .cse3 .cse11 .cse4 .cse12))) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse16 ~token~0) (<= ~token~0 .cse16) .cse2))))) [2021-02-21 21:41:45,153 INFO L185 CegarLoopUtils]: At program point L101-1(line 101) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse14 (or (= ~t1_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (let ((.cse10 (= |old(~E_M~0)| 1)) (.cse11 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse13 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse13 ~token~0) .cse14 (<= ~token~0 .cse13) (= ~m_st~0 0)))) (or .cse15 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse15 .cse6 .cse8 (and (<= 2 ~m_st~0) .cse14)))) [2021-02-21 21:41:45,153 INFO L185 CegarLoopUtils]: At program point immediate_notifyEXIT(lines 328 338) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (and .cse21 (not (= ~E_1~0 1)) .cse2)) (.cse13 (= |old(~m_st~0)| 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~M_E~0 2))) (.cse18 (not (<= ~token~0 ~local~0))) (.cse19 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (= ~t1_st~0 0)) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or (and .cse0 .cse1) (and .cse1 .cse2) (let ((.cse14 (+ ~local~0 1))) (let ((.cse4 (not (<= ~token~0 .cse14))) (.cse6 (not (<= .cse14 ~token~0))) (.cse8 (not (= ~E_M~0 1))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse4 .cse5 (not .cse13) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))))) (or .cse15 .cse3 .cse5 .cse16 .cse17 .cse18 .cse13 (and .cse0 (not .cse1)) .cse9 .cse19 .cse20) (or .cse3 .cse5 .cse16 .cse18 .cse0 .cse17 .cse13 .cse9 .cse10 .cse19 .cse20) (or .cse15 (not .cse7) .cse5 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) .cse18 .cse9 (and (= ~m_st~0 1) .cse2) .cse19 .cse20) (or .cse15 (and (<= 2 ~m_st~0) .cse0) .cse9 (and .cse21 .cse2) .cse11)))) [2021-02-21 21:41:45,154 INFO L185 CegarLoopUtils]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (= ~m_pc~0 0))) (.cse5 (= |old(~t1_st~0)| 0)) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse11 (= |old(~m_st~0)| 0)) (.cse7 (not (= ~t1_i~0 1))) (.cse0 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse17 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (not (<= ~token~0 .cse12))) (.cse4 (not (<= .cse12 ~token~0))) (.cse6 (not (= ~E_M~0 1))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 (not .cse11) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10))))) (or .cse13 .cse7 .cse0 .cse9) (or .cse13 .cse1 .cse3 .cse14 .cse15 .cse11 .cse0 .cse7 .cse16 .cse17) (or .cse13 (not .cse5) .cse3 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) .cse15 .cse7 .cse0 .cse16 .cse17) (or .cse1 .cse3 .cse14 .cse15 .cse11 .cse7 .cse0 .cse8 .cse16 .cse17))) [2021-02-21 21:41:45,154 INFO L185 CegarLoopUtils]: At program point immediate_notifyFINAL(lines 328 338) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (and .cse21 (not (= ~E_1~0 1)) .cse2)) (.cse13 (= |old(~m_st~0)| 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~M_E~0 2))) (.cse18 (not (<= ~token~0 ~local~0))) (.cse19 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (= ~t1_st~0 0)) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or (and .cse0 .cse1) (and .cse1 .cse2) (let ((.cse14 (+ ~local~0 1))) (let ((.cse4 (not (<= ~token~0 .cse14))) (.cse6 (not (<= .cse14 ~token~0))) (.cse8 (not (= ~E_M~0 1))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse4 .cse5 (not .cse13) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))))) (or .cse15 .cse3 .cse5 .cse16 .cse17 .cse18 .cse13 (and .cse0 (not .cse1)) .cse9 .cse19 .cse20) (or .cse3 .cse5 .cse16 .cse18 .cse0 .cse17 .cse13 .cse9 .cse10 .cse19 .cse20) (or .cse15 (not .cse7) .cse5 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) .cse18 .cse9 (and (= ~m_st~0 1) .cse2) .cse19 .cse20) (or .cse15 (and (<= 2 ~m_st~0) .cse0) .cse9 (and .cse21 .cse2) .cse11)))) [2021-02-21 21:41:45,154 INFO L185 CegarLoopUtils]: At program point L320(line 320) the Hoare annotation is: (let ((.cse25 (= |old(~m_st~0)| 0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= activate_threads_~tmp~1 0)) (.cse27 (< 0 (+ activate_threads_~tmp~1 1))) (.cse17 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse2 (= ~E_M~0 1)) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse24 (and .cse28 (or (and .cse26 (<= 1 activate_threads_~tmp___0~0) .cse27) (and (not (= ~E_1~0 1)) .cse26 .cse27)) .cse17)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse20)) (.cse13 (not (= ~M_E~0 2))) (.cse22 (not .cse25)) (.cse14 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse16 (= ~m_st~0 0)) (.cse12 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse28 .cse26 .cse27 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse12 .cse11 .cse13 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse15 .cse7 .cse9) (or (and .cse16 .cse17 (<= 1 activate_threads_~tmp~1)) (let ((.cse23 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse23))) (.cse19 (not (<= .cse23 ~token~0))) (.cse21 (not .cse2))) (and (or .cse0 .cse18 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse18 .cse13 .cse22 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse12 .cse0 .cse13 .cse1 .cse3 .cse24 .cse25 .cse4 .cse15 .cse7) (or .cse0 .cse13 .cse1 .cse3 .cse24 .cse25 .cse4 .cse5 .cse15 .cse7) (or .cse12 .cse11 .cse13 .cse22 .cse14 .cse4 .cse15 .cse10 (and .cse26 .cse27 .cse16 .cse17)) (or .cse12 .cse4 .cse8 .cse9)))) [2021-02-21 21:41:45,155 INFO L185 CegarLoopUtils]: At program point L319(lines 319 323) the Hoare annotation is: (let ((.cse15 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse14 (and .cse29 .cse27 (<= 1 activate_threads_~tmp___0~0) .cse28 .cse20)) (.cse13 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse11 (not .cse23)) (.cse12 (not (= ~M_E~0 2))) (.cse25 (not .cse15)) (.cse18 (not (= ~t1_pc~0 0))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse17 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse13 .cse14 .cse1 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7) (or .cse17 .cse11 .cse12 .cse18 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse16 .cse7 .cse9) (or .cse17 .cse14 .cse13 .cse0 .cse12 .cse1 .cse3 .cse15 .cse4 .cse16 .cse7) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse2))) (and (or .cse0 .cse21 .cse12 .cse22 .cse23 .cse24 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse21 .cse12 .cse25 .cse22 .cse23 .cse24 .cse4 .cse5 .cse10))))) (or .cse17 .cse11 .cse12 .cse25 .cse18 .cse4 .cse16 .cse10 (and .cse27 .cse28 .cse19 .cse20)) (or .cse17 .cse4 .cse8 .cse9)))) [2021-02-21 21:41:45,155 INFO L185 CegarLoopUtils]: At program point L317(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (not (= ~M_E~0 1))) (.cse11 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse3 (not (= ~t1_pc~0 1))) (.cse2 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse17 (not .cse23)) (.cse4 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse18 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse5 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse17 .cse3 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse4 .cse18 (not (= |old(~m_st~0)| 1)) .cse6 .cse8 .cse9 .cse10 .cse15) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse11))) (and (or .cse3 .cse21 .cse4 .cse22 .cse23 .cse24 .cse8 .cse12 .cse14 .cse16) (or .cse3 .cse21 .cse4 .cse25 .cse22 .cse23 .cse24 .cse8 .cse12 .cse16))))) (or .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10) (or .cse0 .cse17 .cse4 .cse25 .cse18 .cse8 .cse9 .cse16 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse14 .cse15)))) [2021-02-21 21:41:45,156 INFO L185 CegarLoopUtils]: At program point L319-2(lines 303 327) the Hoare annotation is: (let ((.cse30 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse29 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse33 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse33)) (.cse24 (and .cse29 .cse0 .cse21 .cse22)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse18 (not .cse8)) (.cse19 (not (= ~t1_pc~0 0))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse6 (not (= ~M_E~0 2))) (.cse32 (and .cse35 .cse30 .cse21 .cse22 .cse3)) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse1 (= ~m_st~0 0)) (.cse34 (<= 1 activate_threads_~tmp___0~0)) (.cse20 (not (= ~E_M~0 ~M_E~0)))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse29 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (let ((.cse31 (not .cse1))) (or .cse17 (and .cse30 .cse0 .cse21 .cse22 .cse31) .cse32 .cse4 .cse6 .cse23 .cse25 .cse33 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse34 .cse22 .cse31))) (or .cse17 .cse18 .cse6 .cse19 (not (= |old(~m_st~0)| 1)) .cse25 .cse10 .cse20 .cse27 .cse28) (or .cse6 .cse32 .cse10 .cse11 .cse27 (and .cse30 .cse0 .cse21 .cse22) .cse4 (and .cse30 .cse0 .cse1) .cse23 .cse25 .cse33 (and .cse0 .cse1 .cse34) (and .cse0 .cse21 .cse34 .cse22) .cse20)))) [2021-02-21 21:41:45,156 INFO L185 CegarLoopUtils]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (not (= ~M_E~0 1))) (.cse11 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse3 (not (= ~t1_pc~0 1))) (.cse2 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse17 (not .cse23)) (.cse4 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse18 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse5 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse17 .cse3 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse4 .cse18 (not (= |old(~m_st~0)| 1)) .cse6 .cse8 .cse9 .cse10 .cse15) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse11))) (and (or .cse3 .cse21 .cse4 .cse22 .cse23 .cse24 .cse8 .cse12 .cse14 .cse16) (or .cse3 .cse21 .cse4 .cse25 .cse22 .cse23 .cse24 .cse8 .cse12 .cse16))))) (or .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10) (or .cse0 .cse17 .cse4 .cse25 .cse18 .cse8 .cse9 .cse16 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse14 .cse15)))) [2021-02-21 21:41:45,157 INFO L185 CegarLoopUtils]: At program point L317-2(line 317) the Hoare annotation is: (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= |old(~m_st~0)| 0)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse2 (= ~E_M~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse11 (not .cse20)) (.cse22 (not .cse26)) (.cse14 (not (= ~t1_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse16 (= ~m_st~0 0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse27 .cse28 .cse17)) (.cse12 (not (= ~m_pc~0 0))) (.cse24 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse17)) (.cse0 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse25 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) (<= 1 activate_threads_~tmp___0~0) .cse28 .cse17)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse12 .cse11 .cse13 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse15 .cse7 .cse9) (or (and .cse16 .cse17 (<= 1 activate_threads_~tmp~1)) (let ((.cse23 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse23))) (.cse19 (not (<= .cse23 ~token~0))) (.cse21 (not .cse2))) (and (or .cse0 .cse18 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse18 .cse13 .cse22 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse0 .cse13 .cse24 .cse25 .cse1 .cse3 .cse26 .cse4 .cse5 .cse15 .cse7) (or .cse12 .cse11 .cse13 .cse22 .cse14 .cse4 .cse15 .cse10 (and .cse27 .cse28 .cse16 .cse17)) (or .cse12 .cse4 .cse8 .cse9) (or .cse12 .cse24 .cse0 .cse13 .cse25 .cse1 .cse3 .cse26 .cse4 .cse15 .cse7)))) [2021-02-21 21:41:45,157 INFO L185 CegarLoopUtils]: At program point L312(line 312) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse7 (= |old(~m_st~0)| 0))) (let ((.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (= ~M_E~0 2))) (.cse20 (not .cse7)) (.cse12 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not .cse18)) (.cse3 (not (= ~t1_pc~0 1))) (.cse13 (= ~E_M~0 1)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse1 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (not (= ~M_E~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse4 .cse12 (not (= |old(~m_st~0)| 1)) .cse6 .cse1 .cse9 .cse10) (or .cse3 .cse5 .cse13 .cse6 .cse1 .cse8 .cse14 .cse10 .cse2 .cse15) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 .cse9 .cse10) (or (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse13))) (and (or .cse3 .cse16 .cse4 .cse17 .cse18 .cse19 .cse1 .cse8 .cse2 .cse15) (or .cse3 .cse16 .cse4 .cse20 .cse17 .cse18 .cse19 .cse1 .cse8 .cse15))))) (or .cse0 .cse11 .cse4 .cse20 .cse12 .cse1 .cse9 .cse15) (or .cse11 .cse3 .cse13 .cse6 .cse1 .cse8 .cse14 .cse10 .cse2 .cse15)))) [2021-02-21 21:41:45,157 INFO L185 CegarLoopUtils]: At program point L311(lines 311 315) the Hoare annotation is: (let ((.cse21 (= |old(~t1_st~0)| 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (<= activate_threads_~tmp~1 0)) (.cse8 (< 0 (+ activate_threads_~tmp~1 1))) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= |old(~m_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse3 (not .cse16)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse18 .cse7 .cse8 .cse9)) (.cse1 (not .cse21)) (.cse14 (not (= ~t1_pc~0 1))) (.cse24 (= ~E_M~0 1)) (.cse11 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= ~local~0 ~token~0))) (.cse23 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 (= ~m_st~0 0) .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse4 (not (= |old(~m_st~0)| 1)) .cse11 .cse5 .cse6 .cse12 .cse13) (or .cse14 .cse2 .cse15 .cse11 .cse16 .cse5 .cse17 .cse6 .cse12 .cse13) (or (and .cse18 .cse9 (<= 1 activate_threads_~tmp~1)) (let ((.cse25 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse25))) (.cse20 (not (<= .cse25 ~token~0))) (.cse22 (not .cse24))) (and (or .cse14 .cse19 .cse2 .cse20 .cse21 .cse22 .cse5 .cse17 .cse23 .cse10) (or .cse14 .cse19 .cse2 .cse3 .cse20 .cse21 .cse22 .cse5 .cse17 .cse10))))) (or .cse0 .cse5 .cse23 .cse13) (or .cse0 .cse14 .cse2 .cse15 .cse11 .cse16 .cse5 .cse6 .cse12 .cse13) (or .cse14 .cse15 .cse24 .cse11 .cse5 .cse17 .cse26 .cse12 .cse23 .cse10 .cse13) (or .cse1 .cse14 .cse24 .cse11 .cse5 .cse17 .cse26 .cse12 .cse23 .cse10 (and .cse18 (= ~t1_st~0 0) .cse7 .cse8))))) [2021-02-21 21:41:45,157 INFO L185 CegarLoopUtils]: At program point L309(line 309) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse24 (= |old(~m_st~0)| 0))) (let ((.cse13 (not .cse24)) (.cse2 (= ~E_M~0 1)) (.cse6 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not .cse20)) (.cse14 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse12 (not (= ~M_E~0 2))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse17 (and .cse7 .cse15)) (.cse5 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse4 (and (= ~m_st~0 0) .cse15) .cse16 .cse10) (or .cse17 (let ((.cse22 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse22))) (.cse19 (not (<= .cse22 ~token~0))) (.cse21 (not .cse2))) (and (or .cse1 .cse18 .cse12 .cse19 .cse20 .cse21 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse11 .cse4 .cse17 .cse9) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse23 .cse3 .cse24 .cse17 .cse4 .cse16 .cse8) (or .cse11 .cse0 .cse12 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse17 .cse16 .cse8) (or .cse1 .cse12 .cse23 .cse3 .cse24 .cse4 .cse17 .cse5 .cse16 .cse8)))) [2021-02-21 21:41:45,158 INFO L185 CegarLoopUtils]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse25 (<= activate_threads_~tmp~1 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (= |old(~m_st~0)| 0)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse2 (= ~E_M~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse11 (not .cse20)) (.cse22 (not .cse24)) (.cse14 (not (= ~t1_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse16 (= ~m_st~0 0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (= ~m_pc~0 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse9 (and (= ~m_st~0 |old(~m_st~0)|) .cse25 .cse26 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse12 .cse11 .cse13 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse15 .cse7 .cse9) (or (and .cse16 .cse17 (<= 1 activate_threads_~tmp~1)) (let ((.cse23 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse23))) (.cse19 (not (<= .cse23 ~token~0))) (.cse21 (not .cse2))) (and (or .cse0 .cse18 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse18 .cse13 .cse22 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse0 .cse13 .cse1 .cse3 .cse24 .cse4 .cse5 .cse15 .cse7 .cse9) (or .cse12 .cse11 .cse13 .cse22 .cse14 .cse4 .cse15 .cse10 (and .cse25 .cse26 .cse16 .cse17)) (or .cse12 .cse4 .cse8 .cse9) (or .cse12 .cse0 .cse13 .cse1 .cse3 .cse24 .cse4 .cse15 .cse7 .cse9)))) [2021-02-21 21:41:45,158 INFO L185 CegarLoopUtils]: At program point L309-1(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse16 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse13 (not (= ~M_E~0 1))) (.cse17 (not .cse16)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (<= 2 ~E_1~0))) (.cse11 (= ~E_M~0 1)) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse3 (and .cse21 .cse18 .cse19 .cse20)) (.cse6 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 1)) .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or .cse9 .cse2 .cse3 .cse10 .cse5 .cse16 .cse6 .cse12 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse15 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse9 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse11))) (and (or .cse9 .cse22 .cse2 .cse23 .cse24 .cse25 .cse6 .cse12 .cse14 .cse15) (or .cse9 .cse22 .cse2 .cse17 .cse23 .cse24 .cse25 .cse6 .cse12 .cse15))))) (or .cse0 .cse3 .cse9 .cse2 .cse10 .cse5 .cse16 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse6 .cse14)))) [2021-02-21 21:41:45,158 INFO L185 CegarLoopUtils]: At program point L309-2(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse16 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse13 (not (= ~M_E~0 1))) (.cse17 (not .cse16)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (<= 2 ~E_1~0))) (.cse11 (= ~E_M~0 1)) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse3 (and .cse21 .cse18 .cse19 .cse20)) (.cse6 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 1)) .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or .cse9 .cse2 .cse3 .cse10 .cse5 .cse16 .cse6 .cse12 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse15 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse9 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse11))) (and (or .cse9 .cse22 .cse2 .cse23 .cse24 .cse25 .cse6 .cse12 .cse14 .cse15) (or .cse9 .cse22 .cse2 .cse17 .cse23 .cse24 .cse25 .cse6 .cse12 .cse15))))) (or .cse0 .cse3 .cse9 .cse2 .cse10 .cse5 .cse16 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse6 .cse14)))) [2021-02-21 21:41:45,159 INFO L185 CegarLoopUtils]: At program point L309-3(line 309) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (<= activate_threads_~tmp~1 0)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse24 (<= |activate_threads_#t~ret11| 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~t1_st~0)| 0)) (.cse28 (= |old(~m_st~0)| 0))) (let ((.cse12 (not .cse28)) (.cse26 (not (= ~t1_pc~0 0))) (.cse21 (not .cse6)) (.cse13 (= ~E_M~0 1)) (.cse17 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse27 (not (= ~E_M~0 ~M_E~0))) (.cse18 (and .cse0 .cse22 .cse23 .cse24 .cse1 .cse25)) (.cse19 (not (<= ~local~0 ~token~0)))) (and (or (and .cse0 (<= 1 |activate_threads_#t~ret11|) .cse1 (<= 1 activate_threads_~tmp~1)) (let ((.cse14 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 .cse14))) (.cse5 (not (<= .cse14 ~token~0))) (.cse7 (not .cse13))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11))))) (or .cse2 .cse15 .cse13 .cse16 .cse8 .cse9 .cse17 .cse18 .cse19 .cse10 .cse11) (or .cse20 .cse21 .cse4 (and .cse22 .cse23 (= ~m_st~0 0) .cse24 .cse1 .cse25) .cse12 .cse26 .cse8 .cse27 .cse11) (or .cse20 .cse8 .cse18 .cse10) (or .cse20 .cse21 .cse4 .cse26 (not (= |old(~m_st~0)| 1)) .cse16 .cse8 .cse18 .cse27 .cse19) (or (and .cse0 (= ~t1_st~0 0) .cse22 .cse23 .cse24 .cse25) .cse21 .cse2 .cse13 .cse16 .cse8 .cse9 .cse17 .cse19 .cse10 .cse11) (or .cse20 .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse18 .cse27 .cse19) (or .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse9 .cse27 .cse18 .cse19)))) [2021-02-21 21:41:45,159 INFO L185 CegarLoopUtils]: At program point L305(line 305) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse24 (= |old(~m_st~0)| 0))) (let ((.cse13 (not .cse24)) (.cse2 (= ~E_M~0 1)) (.cse6 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not .cse20)) (.cse14 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse12 (not (= ~M_E~0 2))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse17 (and .cse7 .cse15)) (.cse5 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse4 (and (= ~m_st~0 0) .cse15) .cse16 .cse10) (or .cse17 (let ((.cse22 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse22))) (.cse19 (not (<= .cse22 ~token~0))) (.cse21 (not .cse2))) (and (or .cse1 .cse18 .cse12 .cse19 .cse20 .cse21 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse11 .cse4 .cse17 .cse9) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse23 .cse3 .cse24 .cse17 .cse4 .cse16 .cse8) (or .cse11 .cse0 .cse12 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse17 .cse16 .cse8) (or .cse1 .cse12 .cse23 .cse3 .cse24 .cse4 .cse17 .cse5 .cse16 .cse8)))) [2021-02-21 21:41:45,159 INFO L185 CegarLoopUtils]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse24 (= |old(~m_st~0)| 0))) (let ((.cse13 (not .cse24)) (.cse2 (= ~E_M~0 1)) (.cse6 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not .cse20)) (.cse14 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse12 (not (= ~M_E~0 2))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse17 (and .cse7 .cse15)) (.cse5 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse4 (and (= ~m_st~0 0) .cse15) .cse16 .cse10) (or .cse17 (let ((.cse22 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse22))) (.cse19 (not (<= .cse22 ~token~0))) (.cse21 (not .cse2))) (and (or .cse1 .cse18 .cse12 .cse19 .cse20 .cse21 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse11 .cse4 .cse17 .cse9) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse23 .cse3 .cse24 .cse17 .cse4 .cse16 .cse8) (or .cse11 .cse0 .cse12 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse17 .cse16 .cse8) (or .cse1 .cse12 .cse23 .cse3 .cse24 .cse4 .cse17 .cse5 .cse16 .cse8)))) [2021-02-21 21:41:45,160 INFO L185 CegarLoopUtils]: At program point activate_threadsEXIT(lines 303 327) the Hoare annotation is: (let ((.cse30 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse29 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse33 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse33)) (.cse24 (and .cse29 .cse0 .cse21 .cse22)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse18 (not .cse8)) (.cse19 (not (= ~t1_pc~0 0))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse6 (not (= ~M_E~0 2))) (.cse32 (and .cse35 .cse30 .cse21 .cse22 .cse3)) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse1 (= ~m_st~0 0)) (.cse34 (<= 1 activate_threads_~tmp___0~0)) (.cse20 (not (= ~E_M~0 ~M_E~0)))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse29 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (let ((.cse31 (not .cse1))) (or .cse17 (and .cse30 .cse0 .cse21 .cse22 .cse31) .cse32 .cse4 .cse6 .cse23 .cse25 .cse33 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse34 .cse22 .cse31))) (or .cse17 .cse18 .cse6 .cse19 (not (= |old(~m_st~0)| 1)) .cse25 .cse10 .cse20 .cse27 .cse28) (or .cse6 .cse32 .cse10 .cse11 .cse27 (and .cse30 .cse0 .cse21 .cse22) .cse4 (and .cse30 .cse0 .cse1) .cse23 .cse25 .cse33 (and .cse0 .cse1 .cse34) (and .cse0 .cse21 .cse34 .cse22) .cse20)))) [2021-02-21 21:41:45,160 INFO L185 CegarLoopUtils]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (= ~E_M~0 1)) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~M_E~0 2))) (.cse14 (not (= ~t1_pc~0 0))) (.cse11 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse8) (or .cse0 .cse2 .cse14 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse15 .cse5 .cse13 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse1 .cse2 (not (<= ~token~0 .cse16)) (not (<= .cse16 ~token~0)) .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse2 .cse14 .cse11 .cse3 .cse12 .cse15 .cse5 .cse6 .cse13 .cse8))) [2021-02-21 21:41:45,160 INFO L185 CegarLoopUtils]: At program point L191(line 191) the Hoare annotation is: (let ((.cse10 (not (= ~t1_pc~0 0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse5 (not (= ~m_pc~0 1))) (.cse9 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~t1_st~0))) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (= ~E_M~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse8) (or .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (or .cse9 .cse0 .cse4 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse13)) .cse2 (not (<= .cse13 ~token~0)) .cse4 .cse5 .cse14 .cse11 .cse12 .cse8)) (or .cse9 .cse1 .cse2 .cse4 .cse14 .cse11 .cse12 .cse8))) [2021-02-21 21:41:45,161 INFO L185 CegarLoopUtils]: At program point exists_runnable_threadEXIT(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2021-02-21 21:41:45,161 INFO L185 CegarLoopUtils]: At program point L185(line 185) the Hoare annotation is: (let ((.cse2 (= ~t1_st~0 0)) (.cse1 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse3 (not .cse2) .cse5 .cse6 .cse7) (let ((.cse9 (+ ~local~0 1))) (or .cse8 (not (<= ~token~0 .cse9)) .cse4 (not (<= .cse9 ~token~0)) .cse3 .cse10 .cse11 .cse5 .cse6 .cse7)) (or .cse1 .cse8 .cse4 (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) .cse3 .cse10 .cse11 (not (<= ~local~0 ~token~0)) .cse7) (or .cse0 .cse8 .cse4 .cse3 .cse11 .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,161 INFO L185 CegarLoopUtils]: At program point L184(lines 184 189) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (= ~t1_pc~0 0)) .cse2 (not (= ~t1_st~0 0)) .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse7)) .cse1 (not (<= .cse7 ~token~0)) .cse2 (not (= ~m_pc~0 1)) .cse8 .cse3 .cse4 .cse5)) (or .cse0 .cse6 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5))) [2021-02-21 21:41:45,161 INFO L192 CegarLoopUtils]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2021-02-21 21:41:45,161 INFO L185 CegarLoopUtils]: At program point L181(line 181) the Hoare annotation is: (let ((.cse7 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 ~M_E~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or (not (= ~m_pc~0 0)) .cse0 .cse5))) [2021-02-21 21:41:45,161 INFO L192 CegarLoopUtils]: At program point L180(lines 180 190) the Hoare annotation is: true [2021-02-21 21:41:45,162 INFO L185 CegarLoopUtils]: At program point exists_runnable_threadFINAL(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2021-02-21 21:41:45,162 INFO L185 CegarLoopUtils]: At program point is_transmit1_triggeredFINAL(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2021-02-21 21:41:45,162 INFO L192 CegarLoopUtils]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2021-02-21 21:41:45,162 INFO L185 CegarLoopUtils]: At program point is_transmit1_triggeredEXIT(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2021-02-21 21:41:45,162 INFO L185 CegarLoopUtils]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2021-02-21 21:41:45,162 INFO L185 CegarLoopUtils]: At program point L137(line 137) the Hoare annotation is: (let ((.cse17 (= ~t1_st~0 0))) (let ((.cse6 (not (<= 2 ~t1_st~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse2 (not (= ~M_E~0 2))) (.cse13 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse14 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse12 (not .cse17)) (.cse15 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse4 .cse12 .cse7 .cse13 .cse9) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse3 (not (= ~m_st~0 1)) .cse4 .cse12 .cse7 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse16)) .cse2 (not (<= .cse16 ~token~0)) .cse17 (not .cse14) .cse4 .cse5 .cse13 .cse9)) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse12 .cse15 .cse8 .cse9)))) [2021-02-21 21:41:45,163 INFO L185 CegarLoopUtils]: At program point L136(lines 136 141) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_pc~0 0))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~t1_st~0 0))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) (not (= ~m_st~0 1)) .cse3 .cse4 .cse5 (not (<= ~local~0 ~token~0))))) [2021-02-21 21:41:45,163 INFO L192 CegarLoopUtils]: At program point L135(lines 135 144) the Hoare annotation is: true [2021-02-21 21:41:45,163 INFO L185 CegarLoopUtils]: At program point L135-2(lines 135 144) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,163 INFO L185 CegarLoopUtils]: At program point L289-1(lines 278 301) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 ~M_E~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse7 (not (= 2 |old(~M_E~0)|))) (.cse13 (= ~M_E~0 2))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse2 .cse12 .cse13)) (or .cse0 (and .cse2 .cse12 .cse14) (not (= ~t1_pc~0 0)) .cse6 .cse3 .cse7 .cse9 .cse10 (not (= ~m_st~0 0))) (or (and .cse2 .cse13 .cse14) .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse11) (or .cse0 .cse1 .cse3 .cse7 .cse13))) [2021-02-21 21:41:45,163 INFO L185 CegarLoopUtils]: At program point L285(line 285) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15) (or .cse5 .cse7 .cse12 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15)))) [2021-02-21 21:41:45,163 INFO L185 CegarLoopUtils]: At program point L279-1(lines 278 301) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (= ~t1_st~0 0))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15)))) [2021-02-21 21:41:45,164 INFO L185 CegarLoopUtils]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_st~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse12 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse13 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 .cse10 (not (= ~m_st~0 0))) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 .cse9 .cse10 .cse14) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 (not (<= 2 ~t1_st~0)) .cse9 .cse14)))) [2021-02-21 21:41:45,164 INFO L185 CegarLoopUtils]: At program point L294-1(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2021-02-21 21:41:45,164 INFO L185 CegarLoopUtils]: At program point L290(line 290) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10) (or .cse0 .cse1 .cse2 .cse6 (= ~M_E~0 2)))) [2021-02-21 21:41:45,164 INFO L185 CegarLoopUtils]: At program point L284-1(lines 278 301) the Hoare annotation is: (let ((.cse11 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_pc~0 0))) (.cse14 (= ~M_E~0 2)) (.cse1 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse12 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse1 .cse5 .cse6 .cse7 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse13 .cse14)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 .cse13 (= ~M_E~0 |old(~M_E~0)|)) .cse7 .cse4 .cse8 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse4 .cse8 .cse14) (or .cse1 .cse5 (and .cse2 .cse13 .cse3) .cse6 .cse7 .cse4 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse12))) [2021-02-21 21:41:45,164 INFO L185 CegarLoopUtils]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1 .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse6) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point reset_delta_eventsEXIT(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point L295(line 295) the Hoare annotation is: (let ((.cse8 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse4) (or .cse10 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse10 .cse0 .cse4 .cse5 (= ~M_E~0 2)))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point L162-1(lines 161 174) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point init_threadsEXIT(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point L170(line 170) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,165 INFO L185 CegarLoopUtils]: At program point L168(line 168) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-21 21:41:45,166 INFO L185 CegarLoopUtils]: At program point L167-1(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-21 21:41:45,166 INFO L185 CegarLoopUtils]: At program point L165(line 165) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,166 INFO L185 CegarLoopUtils]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,166 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 464 475) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,166 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 464 475) the Hoare annotation is: true [2021-02-21 21:41:45,166 INFO L192 CegarLoopUtils]: At program point L473(line 473) the Hoare annotation is: true [2021-02-21 21:41:45,166 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 464 475) the Hoare annotation is: true [2021-02-21 21:41:45,166 INFO L192 CegarLoopUtils]: At program point L470(line 470) the Hoare annotation is: true [2021-02-21 21:41:45,166 INFO L185 CegarLoopUtils]: At program point L469(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,166 INFO L185 CegarLoopUtils]: At program point L469-1(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,166 INFO L192 CegarLoopUtils]: At program point errorEXIT(lines 8 15) the Hoare annotation is: true [2021-02-21 21:41:45,167 INFO L192 CegarLoopUtils]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2021-02-21 21:41:45,167 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-21 21:41:45,167 INFO L192 CegarLoopUtils]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2021-02-21 21:41:45,167 INFO L192 CegarLoopUtils]: At program point errorFINAL(lines 8 15) the Hoare annotation is: true [2021-02-21 21:41:45,170 INFO L185 CegarLoopUtils]: At program point masterEXIT(lines 32 75) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse19)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and (<= 2 ~t1_st~0) .cse5 .cse17 .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse20)) (.cse4 (not .cse18)) (.cse15 (and .cse5 .cse17 (= ~t1_st~0 0) .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse14 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 (not (<= .cse16 |old(~token~0)|)) .cse15))))) [2021-02-21 21:41:45,171 INFO L185 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (let ((.cse9 (= ~t1_st~0 0)) (.cse17 (= ~E_M~0 ~M_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse18 (= ~t1_i~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse19 (= ~M_E~0 2)) (.cse16 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse16)) (.cse1 (not .cse19)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and .cse16 .cse9 .cse17 .cse11 .cse19 .cse18 .cse10 .cse12 .cse13)) (.cse6 (not .cse18)) (.cse7 (not .cse17)) (.cse15 (not (= |old(~m_pc~0)| 0))) (.cse8 (and (<= 2 ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse17 .cse18 .cse19 .cse11 .cse10 .cse12 .cse13 (= |old(~t1_st~0)| ~t1_st~0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 (= |old(~m_st~0)| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse2 |old(~token~0)|)))) (or (and (= ~m_st~0 1) .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse14 .cse4 .cse6 .cse7 .cse15) (or .cse0 .cse1 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8)))) [2021-02-21 21:41:45,171 INFO L185 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse5 (= ~m_pc~0 0)) (.cse10 (not (= |old(~m_pc~0)| 0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 (and (= ~m_st~0 1) .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse1 .cse7 .cse8 (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6) .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse11 .cse0 (not (<= |old(~token~0)| .cse14)) .cse12 (= |old(~m_st~0)| 0) (and .cse13 .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse6) .cse7 .cse8 .cse9 (not (<= .cse14 |old(~token~0)|)))))) [2021-02-21 21:41:45,171 INFO L185 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-21 21:41:45,172 INFO L185 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (= ~t1_i~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (let ((.cse12 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse12)) .cse2 (= |old(~m_st~0)| 0) .cse4 (and .cse6 .cse7 (= ~m_pc~0 1) .cse9) .cse5 .cse10 (not (<= .cse12 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 (and (= ~m_st~0 1) .cse7 .cse8 .cse9) .cse5 .cse10 .cse11))) [2021-02-21 21:41:45,172 INFO L185 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-21 21:41:45,172 INFO L185 CegarLoopUtils]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse6 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse0 (not (<= |old(~token~0)| .cse7)) .cse8 (= |old(~m_st~0)| 0) .cse2 .cse3 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse4 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-02-21 21:41:45,172 INFO L185 CegarLoopUtils]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse19)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and (<= 2 ~t1_st~0) .cse5 .cse17 .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse20)) (.cse4 (not .cse18)) (.cse15 (and .cse5 .cse17 (= ~t1_st~0 0) .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse14 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 (not (<= .cse16 |old(~token~0)|)) .cse15))))) [2021-02-21 21:41:45,173 INFO L185 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse5 (not (= |old(~m_pc~0)| 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse0 (not (<= |old(~token~0)| .cse8)) .cse7 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 (not (<= .cse8 |old(~token~0)|)))))) [2021-02-21 21:41:45,173 INFO L185 CegarLoopUtils]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-21 21:41:45,173 INFO L185 CegarLoopUtils]: At program point L55(line 55) the Hoare annotation is: (let ((.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~t1_i~0 1)) (.cse10 (= ~M_E~0 2)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_st~0)| 1))) (.cse16 (not (= |old(~m_pc~0)| 0))) (.cse0 (not .cse5)) (.cse1 (not .cse10)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~t1_st~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (<= ~token~0 ~local~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (not .cse8)) (.cse15 (not .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 (and .cse17 .cse9 .cse11 .cse12 .cse13 .cse18)) (or (not (= |old(~t1_st~0)| 0)) .cse1 (and (= ~m_st~0 1) .cse6 .cse9 .cse11 .cse12 .cse13) (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse14 .cse15 .cse16) (let ((.cse19 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse19)) .cse2 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |old(~m_st~0)| 0) .cse4 (and .cse17 .cse9 .cse11 .cse12 .cse18) .cse14 .cse15 (not (<= .cse19 |old(~token~0)|))))))) [2021-02-21 21:41:45,173 INFO L185 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse0 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse11 (= ~m_pc~0 0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (not (= ~M_E~0 2))) (.cse12 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 (= |old(~m_st~0)| 0) .cse4 .cse5 (and .cse6 .cse7 (= ~m_pc~0 1) .cse8 .cse9) .cse10 (not (<= .cse2 |old(~token~0)|)))) (or (and .cse6 .cse7 .cse8 .cse11 .cse9) .cse0 .cse1 .cse3 .cse12 .cse4 .cse5 .cse10 .cse13) (or (and (= ~m_st~0 1) .cse7 .cse8 .cse11 .cse9) (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse12 .cse4 .cse5 .cse10 .cse13))) [2021-02-21 21:41:45,174 INFO L185 CegarLoopUtils]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (not (= ~E_1~0 1))) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (not (= |old(~m_st~0)| 1))) (.cse10 (= ~t1_st~0 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse14 (= ~m_pc~0 0)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse12 (not (= ~E_M~0 ~M_E~0))) (.cse15 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) (= |old(~m_st~0)| 0) .cse9 (and .cse10 .cse6 .cse7) .cse11 .cse12 (not (<= .cse2 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse13 (and (= ~m_st~0 1) .cse10 .cse6 .cse7 .cse14) .cse9 .cse11 .cse12 .cse15) (or .cse0 .cse1 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse14 .cse8) .cse13 (and .cse10 .cse6 .cse7 .cse14) .cse9 .cse11 .cse12 .cse15))) [2021-02-21 21:41:45,174 INFO L185 CegarLoopUtils]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (= ~t1_i~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (let ((.cse12 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse12)) .cse2 (= |old(~m_st~0)| 0) .cse4 (and .cse6 .cse7 (= ~m_pc~0 1) .cse9) .cse5 .cse10 (not (<= .cse12 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 (and (= ~m_st~0 1) .cse7 .cse8 .cse9) .cse5 .cse10 .cse11))) [2021-02-21 21:41:45,174 INFO L185 CegarLoopUtils]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse9)) .cse8 (= |old(~m_st~0)| 0) .cse2 .cse3 (let ((.cse10 (+ ~local~0 1))) (and (<= .cse10 ~token~0) (<= ~token~0 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15)) .cse5 (not (<= .cse9 |old(~token~0)|))))))) [2021-02-21 21:41:45,174 INFO L185 CegarLoopUtils]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse6 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse0 (not (<= |old(~token~0)| .cse7)) .cse8 (= |old(~m_st~0)| 0) .cse2 .cse3 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse4 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point fire_time_eventsEXIT(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (= ~M_E~0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse4 .cse6))) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point fire_time_eventsFINAL(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,175 INFO L185 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,176 INFO L185 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L22(line 22) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-21 21:41:45,177 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,178 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~E_M~0 |old(~E_M~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~m_i~0 |old(~m_i~0)|)) [2021-02-21 21:41:45,178 INFO L185 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,178 INFO L185 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-21 21:41:45,178 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-21 21:41:45,178 INFO L185 CegarLoopUtils]: At program point stop_simulationFINAL(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 1 stop_simulation_~__retres2~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,179 INFO L185 CegarLoopUtils]: At program point L401(lines 390 403) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 1 stop_simulation_~__retres2~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,179 INFO L185 CegarLoopUtils]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse5 (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1)))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9))) [2021-02-21 21:41:45,179 INFO L185 CegarLoopUtils]: At program point L395(line 395) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,179 INFO L185 CegarLoopUtils]: At program point L394(lines 394 399) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1))) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,179 INFO L192 CegarLoopUtils]: At program point L392(line 392) the Hoare annotation is: true [2021-02-21 21:41:45,179 INFO L185 CegarLoopUtils]: At program point L392-1(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,180 INFO L185 CegarLoopUtils]: At program point L392-2(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,180 INFO L185 CegarLoopUtils]: At program point stop_simulationEXIT(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 1 stop_simulation_~__retres2~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,180 INFO L185 CegarLoopUtils]: At program point L392-3(line 392) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-21 21:41:45,180 INFO L192 CegarLoopUtils]: At program point L388(line 388) the Hoare annotation is: true [2021-02-21 21:41:45,180 INFO L192 CegarLoopUtils]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2021-02-21 21:41:45,181 INFO L185 CegarLoopUtils]: At program point L217(line 217) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse3 (not (= eval_~tmp~0 0)))) (let ((.cse13 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse7 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse14 (let ((.cse16 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse16) (<= .cse16 ~token~0) .cse11 .cse2 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse3))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |old(~token~0)| ~token~0))) (or .cse0 (and (= ~local~0 |old(~local~0)|) .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 (= |old(~t1_st~0)| ~t1_st~0) .cse6) .cse7 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse8 .cse9 (and .cse1 (or (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse10 .cse11 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse4 .cse5)) (and .cse10 .cse11 .cse4 .cse5 .cse6)) .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse13 .cse14)) (or .cse9 .cse13 .cse15) (or (not (= |old(~m_pc~0)| 1)) .cse0 (= |old(~E_M~0)| 1) .cse7 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse8 .cse9 .cse14 .cse15)))) [2021-02-21 21:41:45,181 INFO L185 CegarLoopUtils]: At program point L213(line 213) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-21 21:41:45,181 INFO L185 CegarLoopUtils]: At program point L205(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2021-02-21 21:41:45,182 INFO L185 CegarLoopUtils]: At program point L205-1(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2021-02-21 21:41:45,182 INFO L185 CegarLoopUtils]: At program point L205-2(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse3 (not (= |eval_#t~ret8| 0))) (.cse20 (= ~t1_st~0 0)) (.cse5 (not (= eval_~tmp~0 0))) (.cse26 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse21 (= ~E_M~0 ~M_E~0)) (.cse4 (<= ~token~0 ~local~0)) (.cse22 (= ~m_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (let ((.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse19 (not (= |old(~m_pc~0)| 0))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (and .cse26 .cse17 .cse1 .cse21 .cse4 .cse22 .cse23 .cse6)) (.cse13 (and .cse17 .cse1 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse6)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (let ((.cse27 (+ ~local~0 1))) (and .cse26 (<= ~token~0 .cse27) (<= .cse27 ~token~0) .cse1 .cse3 .cse21 .cse22 .cse23 .cse25 .cse5))) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (and (or .cse0 (not (= |old(~t1_pc~0)| 1)) (and .cse1 (= ~m_st~0 |old(~m_st~0)|) .cse2 .cse3 (= ~m_pc~0 |old(~m_pc~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (= |old(~m_pc~0)| 1)) .cse11 (= |old(~E_M~0)| 1) .cse12 .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 .cse15 .cse16) (or .cse10 (and .cse17 .cse18) .cse19 .cse16) (let ((.cse24 (= ~t1_pc~0 0))) (or .cse0 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse19 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse17 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse24 .cse6) .cse14 .cse15 (and (= ~local~0 |old(~local~0)|) .cse3 .cse2 .cse5 .cse25 .cse24 .cse18 .cse7 .cse9 .cse8) (and .cse26 .cse1 .cse3 .cse2 .cse21 .cse25 .cse5 .cse18 .cse9)))))) [2021-02-21 21:41:45,182 INFO L185 CegarLoopUtils]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2021-02-21 21:41:45,183 INFO L185 CegarLoopUtils]: At program point evalEXIT(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2021-02-21 21:41:45,183 INFO L185 CegarLoopUtils]: At program point L218(line 218) the Hoare annotation is: (let ((.cse24 (+ ~local~0 1))) (let ((.cse8 (<= 2 ~t1_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse10 (<= .cse24 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_pc~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (not (= eval_~tmp~0 0))) (.cse17 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= |old(~m_pc~0)| 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (= ~m_st~0 1)) (.cse18 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~m_st~0 0))) .cse16) (or .cse7 .cse17 .cse16) (let ((.cse20 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~m_pc~0 0)) (.cse23 (= |old(~token~0)| ~token~0))) (or .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse18 (and .cse19 .cse20 (or (let ((.cse21 (+ |old(~token~0)| 1))) (and .cse8 .cse11 (<= .cse21 ~token~0) (<= ~token~0 .cse21) .cse22)) (and .cse8 .cse11 .cse22 .cse23)) .cse15 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse6 (and .cse19 .cse20 (= ~t1_st~0 0) .cse12 .cse15 (= ~t1_pc~0 0) .cse22 .cse23) (and .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15) .cse7 .cse17)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse18 .cse5 .cse6 .cse7 .cse16)))) [2021-02-21 21:41:45,183 INFO L185 CegarLoopUtils]: At program point L214(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-21 21:41:45,184 INFO L185 CegarLoopUtils]: At program point L214-1(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-21 21:41:45,184 INFO L185 CegarLoopUtils]: At program point L214-2(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-21 21:41:45,184 INFO L185 CegarLoopUtils]: At program point L231(line 231) the Hoare annotation is: (let ((.cse6 (= ~t1_i~0 1))) (let ((.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse14 (not .cse6)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse12 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse16 (not (= |old(~m_pc~0)| 0))) (.cse9 (not (= eval_~tmp~0 0))) (.cse11 (= ~E_M~0 |old(~E_M~0)|))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) .cse12) .cse13 .cse14 .cse15) (or (and .cse2 .cse4 (= ~m_pc~0 0)) .cse14 .cse16 .cse15) (let ((.cse17 (= ~t1_pc~0 0))) (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse2 .cse4 .cse5 .cse7 .cse12 .cse8 .cse9 .cse17 .cse10) .cse13 .cse14 (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11) .cse16 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse17 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= |old(~token~0)| ~token~0))))))) [2021-02-21 21:41:45,185 INFO L185 CegarLoopUtils]: At program point L227(line 227) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-21 21:41:45,185 INFO L185 CegarLoopUtils]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= ~M_E~0 2))) (.cse1 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse9 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or (not (= |old(~m_pc~0)| 1)) .cse11 (and .cse2 .cse3 (= ~t1_st~0 0) .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse7 .cse8) (= |old(~E_M~0)| 1) .cse12 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 .cse0 .cse10) (or .cse11 .cse12 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse3 .cse4 (= ~E_M~0 ~M_E~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse6 .cse8) .cse13 .cse0 .cse9))) [2021-02-21 21:41:45,185 INFO L185 CegarLoopUtils]: At program point L215(lines 215 222) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-21 21:41:45,186 INFO L185 CegarLoopUtils]: At program point L207(lines 207 211) the Hoare annotation is: (let ((.cse13 (= ~t1_st~0 0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (<= 2 ~t1_st~0)) (.cse20 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~m_pc~0 1)) (.cse17 (<= 2 ~E_1~0)) (.cse8 (= ~m_st~0 0)) (.cse7 (not (= eval_~tmp~0 0)))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0)) (.cse21 (let ((.cse26 (+ ~local~0 1))) (and .cse19 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse20 .cse14 .cse16 .cse17 .cse8 .cse7))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse23 (and .cse19 .cse1 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18)) (.cse24 (and .cse1 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse9 (= ~t1_pc~0 0))) (or .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse9 .cse18) (and .cse19 .cse20 .cse6 .cse14 .cse8 .cse7 .cse2 .cse11) .cse0 .cse3 .cse21 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse20 (= ~m_st~0 |old(~m_st~0)|) .cse6 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse7 .cse18 .cse10 .cse12 .cse11) .cse21 (not (= |old(~m_pc~0)| 1)) .cse22 (= |old(~E_M~0)| 1) .cse23 .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2021-02-21 21:41:45,186 INFO L185 CegarLoopUtils]: At program point L207-1(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2021-02-21 21:41:45,186 INFO L185 CegarLoopUtils]: At program point L203(line 203) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2021-02-21 21:41:45,187 INFO L185 CegarLoopUtils]: At program point L232(line 232) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_st~0 0)) (.cse19 (= |old(~token~0)| ~token~0)) (.cse16 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (<= 2 ~m_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse12 (<= 2 ~E_1~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse13 (not (= eval_~tmp~0 0))) (.cse14 (<= ~local~0 ~token~0)) (.cse10 (= ~m_pc~0 1)) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse15 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) .cse16 .cse0 (and .cse17 .cse8 .cse11 .cse18 .cse13 .cse15 .cse2 .cse19) (and .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) .cse3)) (let ((.cse20 (= ~E_M~0 |old(~E_M~0)|))) (or (not (= |old(~m_pc~0)| 1)) .cse5 .cse6 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse7 .cse17 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse20 .cse19) .cse16 .cse0 (and (or (and .cse1 .cse7 .cse9 .cse12 .cse11 .cse13 .cse14 .cse20) (and .cse1 .cse7 .cse8 .cse9 .cse12 .cse11 .cse13 .cse14)) .cse10) .cse4)))) [2021-02-21 21:41:45,187 INFO L185 CegarLoopUtils]: At program point L228(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-21 21:41:45,188 INFO L185 CegarLoopUtils]: At program point L228-1(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-21 21:41:45,188 INFO L185 CegarLoopUtils]: At program point L228-2(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-21 21:41:45,188 INFO L185 CegarLoopUtils]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2021-02-21 21:41:45,188 INFO L185 CegarLoopUtils]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2021-02-21 21:41:45,189 INFO L185 CegarLoopUtils]: At program point L229(lines 229 236) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-21 21:41:45,189 INFO L185 CegarLoopUtils]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse4 (not (= ~t1_pc~0 1)) .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse5 .cse8 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse9 (not (<= ~local~0 ~token~0)))))) [2021-02-21 21:41:45,189 INFO L185 CegarLoopUtils]: At program point L256-1(lines 250 273) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 .cse4 .cse5 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 (= ~M_E~0 |old(~M_E~0)|) .cse3) .cse6 .cse4 .cse5 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (and .cse2 (= ~E_M~0 ~M_E~0) .cse3) (not (<= ~token~0 ~local~0)) .cse6 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))))) [2021-02-21 21:41:45,189 INFO L185 CegarLoopUtils]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1 .cse2) (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse2 .cse3 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse2 .cse3 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))))) [2021-02-21 21:41:45,189 INFO L185 CegarLoopUtils]: At program point L267(line 267) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2021-02-21 21:41:45,189 INFO L185 CegarLoopUtils]: At program point L261-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (and .cse2 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse3 .cse6 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2021-02-21 21:41:45,190 INFO L185 CegarLoopUtils]: At program point L257(line 257) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2021-02-21 21:41:45,190 INFO L185 CegarLoopUtils]: At program point L251-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2021-02-21 21:41:45,190 INFO L185 CegarLoopUtils]: At program point fire_delta_eventsEXIT(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2021-02-21 21:41:45,190 INFO L185 CegarLoopUtils]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2021-02-21 21:41:45,190 INFO L185 CegarLoopUtils]: At program point L262(line 262) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2021-02-21 21:41:45,190 INFO L192 CegarLoopUtils]: At program point update_channelsEXIT(lines 150 157) the Hoare annotation is: true [2021-02-21 21:41:45,190 INFO L192 CegarLoopUtils]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2021-02-21 21:41:45,191 INFO L185 CegarLoopUtils]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0))) (or (and (<= 2 ~m_st~0) (= ~M_E~0 2) .cse0 .cse1) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)))) [2021-02-21 21:41:45,191 INFO L192 CegarLoopUtils]: At program point start_simulationEXIT(lines 405 463) the Hoare annotation is: true [2021-02-21 21:41:45,191 INFO L185 CegarLoopUtils]: At program point L407(line 407) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-21 21:41:45,191 INFO L185 CegarLoopUtils]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,191 INFO L185 CegarLoopUtils]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,191 INFO L185 CegarLoopUtils]: At program point L428(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,191 INFO L185 CegarLoopUtils]: At program point L428-1(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,192 INFO L185 CegarLoopUtils]: At program point L424(line 424) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2021-02-21 21:41:45,192 INFO L185 CegarLoopUtils]: At program point L424-1(line 424) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,192 INFO L185 CegarLoopUtils]: At program point L420-1(lines 417 457) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2021-02-21 21:41:45,192 INFO L185 CegarLoopUtils]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-21 21:41:45,192 INFO L185 CegarLoopUtils]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (= ~t1_st~0 0)) (.cse1 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse1 (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and (<= 2 ~m_st~0) .cse0 (= ~M_E~0 2) .cse1) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,192 INFO L185 CegarLoopUtils]: At program point L412(line 412) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-21 21:41:45,193 INFO L185 CegarLoopUtils]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-21 21:41:45,193 INFO L185 CegarLoopUtils]: At program point L408(line 408) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-21 21:41:45,193 INFO L185 CegarLoopUtils]: At program point L437(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,193 INFO L185 CegarLoopUtils]: At program point L437-1(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,193 INFO L185 CegarLoopUtils]: At program point L437-2(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,193 INFO L185 CegarLoopUtils]: At program point L433(line 433) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,193 INFO L192 CegarLoopUtils]: At program point L458(lines 405 463) the Hoare annotation is: true [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L421(line 421) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L450(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L450-1(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L450-2(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-21 21:41:45,194 INFO L185 CegarLoopUtils]: At program point L442(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-21 21:41:45,195 INFO L185 CegarLoopUtils]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,195 INFO L185 CegarLoopUtils]: At program point L434(line 434) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,195 INFO L185 CegarLoopUtils]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 .cse4 (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse4 .cse3 (= ~E_M~0 |old(~E_M~0)|)))) [2021-02-21 21:41:45,195 INFO L185 CegarLoopUtils]: At program point L443(line 443) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,195 INFO L185 CegarLoopUtils]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-21 21:41:45,195 INFO L185 CegarLoopUtils]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,196 INFO L185 CegarLoopUtils]: At program point L452(lines 452 456) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-21 21:41:45,196 INFO L185 CegarLoopUtils]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse13 (= ~t1_st~0 0)) (.cse7 (= ~m_st~0 0))) (let ((.cse18 (= ~E_M~0 1)) (.cse21 (not (= ~M_E~0 1))) (.cse17 (not .cse7)) (.cse16 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse20 (not .cse13)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse15 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (<= 2 ~m_st~0))) (.cse1 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (<= 1 is_master_triggered_~__retres1~0) (let ((.cse19 (+ ~local~0 1))) (let ((.cse11 (not (<= ~token~0 .cse19))) (.cse12 (not (<= .cse19 ~token~0))) (.cse14 (not .cse18))) (and (or .cse10 .cse2 .cse11 .cse3 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16) (or .cse2 .cse11 .cse3 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17 .cse16))))) (or .cse10 .cse2 .cse1 .cse18 .cse4 .cse5 .cse15 .cse20 .cse21 .cse9 .cse16) (or .cse10 .cse2 .cse1 .cse18 .cse4 .cse5 .cse15 .cse6 .cse21 .cse9 .cse16) (or .cse0 .cse1 .cse3 .cse22 .cse5 .cse20 .cse8 .cse17 .cse16) (or .cse0 .cse3 .cse1 .cse22 .cse4 (not (= ~m_st~0 1)) .cse5 .cse20 .cse8 .cse9) (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse5)))) [2021-02-21 21:41:45,196 INFO L185 CegarLoopUtils]: At program point L118(line 118) the Hoare annotation is: (let ((.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (= ~m_st~0 0)) (.cse2 (not (= ~M_E~0 2))) (.cse9 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse12 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= ~t1_st~0 0))) (.cse15 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse9 .cse4 .cse10 .cse7 (not .cse6) .cse11) (or .cse12 .cse1 .cse13 .cse3 .cse4 .cse14 .cse5 .cse15 .cse8 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse9 .cse3 (not (= ~m_st~0 1)) .cse4 .cse10 .cse7 .cse8) (or .cse0 .cse12 .cse4) (or .cse12 .cse1 .cse13 .cse3 .cse4 .cse14 .cse10 .cse15 .cse8 .cse11))) [2021-02-21 21:41:45,196 INFO L185 CegarLoopUtils]: At program point L117(lines 117 122) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse1 (not (= ~M_E~0 2))) (.cse7 (not (= ~t1_pc~0 0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_st~0 0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse3 (not (= ~t1_i~0 1)))) (and (or .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3 (not (<= 2 ~t1_st~0)) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse8 .cse5 (not .cse4) (not (<= 2 ~E_1~0))) (or .cse0 .cse1 .cse7 .cse2 (not (= ~m_st~0 1)) .cse3 .cse8 .cse5 .cse6) (or .cse0 (not (<= 2 ~m_st~0)) .cse3))) [2021-02-21 21:41:45,197 INFO L185 CegarLoopUtils]: At program point is_master_triggeredFINAL(lines 112 130) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0)) (.cse19 (= ~t1_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse14 (not (= ~t1_pc~0 0))) (.cse7 (not .cse19)) (.cse21 (not .cse16)) (.cse10 (not (<= 2 ~E_1~0))) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse12 .cse13 .cse14 .cse2 .cse4 (not (= ~m_st~0 1)) .cse5 .cse7 .cse15 .cse9) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse16 .cse15 .cse9) (or (let ((.cse22 (+ ~local~0 1))) (let ((.cse17 (not (<= ~token~0 .cse22))) (.cse18 (not (<= .cse22 ~token~0))) (.cse20 (not .cse3))) (and (or .cse0 .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse10) (or .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse21 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse14 .cse2 .cse5 .cse7 .cse15 .cse21 .cse10) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse16 .cse15 .cse9)))) [2021-02-21 21:41:45,197 INFO L192 CegarLoopUtils]: At program point L116(lines 116 125) the Hoare annotation is: true [2021-02-21 21:41:45,197 INFO L185 CegarLoopUtils]: At program point L116-2(lines 116 125) the Hoare annotation is: (let ((.cse9 (+ ~local~0 1))) (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (<= ~token~0 .cse9))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= .cse9 ~token~0))) (.cse4 (= ~t1_st~0 0)) (.cse5 (not (= ~E_M~0 1))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8)))) [2021-02-21 21:41:45,197 INFO L185 CegarLoopUtils]: At program point is_master_triggeredEXIT(lines 112 130) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0)) (.cse19 (= ~t1_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse14 (not (= ~t1_pc~0 0))) (.cse7 (not .cse19)) (.cse21 (not .cse16)) (.cse10 (not (<= 2 ~E_1~0))) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse12 .cse13 .cse14 .cse2 .cse4 (not (= ~m_st~0 1)) .cse5 .cse7 .cse15 .cse9) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse16 .cse15 .cse9) (or (let ((.cse22 (+ ~local~0 1))) (let ((.cse17 (not (<= ~token~0 .cse22))) (.cse18 (not (<= .cse22 ~token~0))) (.cse20 (not .cse3))) (and (or .cse0 .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse10) (or .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse21 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse14 .cse2 .cse5 .cse7 .cse15 .cse21 .cse10) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse16 .cse15 .cse9)))) [2021-02-21 21:41:45,197 INFO L192 CegarLoopUtils]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2021-02-21 21:41:45,197 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 21:41:45,197 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-21 21:41:45,197 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 21:41:45,197 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 21:41:45,198 INFO L185 CegarLoopUtils]: At program point L353(line 353) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-21 21:41:45,198 INFO L185 CegarLoopUtils]: At program point reset_time_eventsEXIT(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-21 21:41:45,198 INFO L185 CegarLoopUtils]: At program point L368(line 368) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2021-02-21 21:41:45,198 INFO L185 CegarLoopUtils]: At program point L362-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse3 (and .cse1 (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse10) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse10)))) [2021-02-21 21:41:45,198 INFO L185 CegarLoopUtils]: At program point L358(line 358) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2021-02-21 21:41:45,199 INFO L185 CegarLoopUtils]: At program point L352-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2021-02-21 21:41:45,199 INFO L185 CegarLoopUtils]: At program point reset_time_eventsENTRY(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-21 21:41:45,199 INFO L185 CegarLoopUtils]: At program point L367-1(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-21 21:41:45,199 INFO L185 CegarLoopUtils]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse1 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2021-02-21 21:41:45,199 INFO L185 CegarLoopUtils]: At program point L357-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse4 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 .cse2) .cse3) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2021-02-21 21:41:45,200 INFO L185 CegarLoopUtils]: At program point init_modelFINAL(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,200 INFO L185 CegarLoopUtils]: At program point L381(line 381) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,200 INFO L185 CegarLoopUtils]: At program point init_modelEXIT(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,200 INFO L185 CegarLoopUtils]: At program point init_modelENTRY(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-21 21:41:45,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 09:41:45 BoogieIcfgContainer [2021-02-21 21:41:45,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 21:41:45,277 INFO L168 Benchmark]: Toolchain (without parser) took 269806.29 ms. Allocated memory was 163.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 140.1 MB in the beginning and 1.0 GB in the end (delta: -876.6 MB). Peak memory consumption was 939.9 MB. Max. memory is 8.0 GB. [2021-02-21 21:41:45,277 INFO L168 Benchmark]: CDTParser took 1.21 ms. Allocated memory is still 163.6 MB. Free memory is still 136.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 21:41:45,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.45 ms. Allocated memory is still 163.6 MB. Free memory was 138.9 MB in the beginning and 126.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-02-21 21:41:45,278 INFO L168 Benchmark]: Boogie Preprocessor took 96.16 ms. Allocated memory is still 163.6 MB. Free memory was 126.1 MB in the beginning and 124.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-21 21:41:45,278 INFO L168 Benchmark]: RCFGBuilder took 1376.80 ms. Allocated memory is still 163.6 MB. Free memory was 124.0 MB in the beginning and 118.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. [2021-02-21 21:41:45,278 INFO L168 Benchmark]: TraceAbstraction took 267898.25 ms. Allocated memory was 163.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 117.7 MB in the beginning and 1.0 GB in the end (delta: -898.9 MB). Peak memory consumption was 916.7 MB. Max. memory is 8.0 GB. [2021-02-21 21:41:45,279 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21 ms. Allocated memory is still 163.6 MB. Free memory is still 136.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 404.45 ms. Allocated memory is still 163.6 MB. Free memory was 138.9 MB in the beginning and 126.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.16 ms. Allocated memory is still 163.6 MB. Free memory was 126.1 MB in the beginning and 124.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1376.80 ms. Allocated memory is still 163.6 MB. Free memory was 124.0 MB in the beginning and 118.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 267898.25 ms. Allocated memory was 163.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 117.7 MB in the beginning and 1.0 GB in the end (delta: -898.9 MB). Peak memory consumption was 916.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) && (1 <= __retres1 || ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 0)) || !(token <= local)) || !(m_st == 1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((!(m_pc == 0) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(t1_i == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) && (((((((((((__retres1 <= 0 && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || ((((((((2 <= m_st && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && t1_pc == 0) && local <= token)) || (((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && E_M == M_E) && m_st == 0) && !(tmp == 0)) && m_pc == 0) && \old(token) == token)) || (((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && E_M == M_E) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token)) || !(t1_i == 1)) || !(\old(m_pc) == 0)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(t1_st) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1)))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(t1_i == 1)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(m_pc) == 1)) || ((((((((t1_pc == 1 && m_st == \old(m_st)) && E_1 == \old(E_1)) && t1_st == 0) && m_pc == \old(m_pc)) && token <= local) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(m_st))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(t1_i == 1)) || !(2 <= \old(m_st))) && (((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || ((((m_st == \old(m_st) && t1_pc == 1) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || (((((((t1_st == 0 && M_E == 2) && 2 <= E_1) && m_st == 0) && t1_pc == 0) && m_pc == 0) && \old(token) == token) && E_M == \old(E_M))) || !(\old(m_st) == 0)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || (2 <= m_st && m_pc == 0)) || !(\old(E_M) == \old(M_E))) || !(\old(m_pc) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && !(E_M == 1)) && token <= local) && M_E == 2) && m_pc == 1) && 2 <= E_1) && local <= token) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || ((tmp <= 0 && 0 < tmp + 1) && 1 <= __retres2)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((local + 1 <= token && token <= local + 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token)))) && (((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((!(t1_pc == 1) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((!(m_pc == 0) || ((((E_M == M_E && m_st == 0) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((m_st == \old(m_st) && E_M == M_E) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((!(m_pc == 0) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (2 <= m_st && (t1_st == 0 || \old(t1_st) == t1_st)))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((t1_pc == 1 && \old(token) + 1 <= token) && (t1_st == 0 || \old(t1_st) == t1_st)) && token <= \old(token) + 1) && E_M == M_E) && m_st == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) - ProcedureContractResult [Line: 76]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - ProcedureContractResult [Line: 303]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: (((((((((((t1_st == 0 && m_st == 0) && 1 <= tmp) || ((m_st == 0 && \old(t1_st) == t1_st) && 1 <= tmp)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)))) && ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(E_M == M_E)) || (((tmp <= 0 && 0 < tmp + 1) && m_st == 0) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((!(t1_pc == 1) || !(2 <= \old(t1_st))) || E_M == 1) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && ((((!(m_pc == 0) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && ((((((((((2 <= m_st || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((!(\old(t1_st) == 0) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((!(m_pc == 0) || ((((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1) && !(m_st == 0))) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || ((((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1) && !(m_st == 0)))) && (((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(token <= local)) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && (((((((((((((!(M_E == 2) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(m_pc == 1)) || !(local <= token)) || (((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || ((!(E_1 == 1) && t1_st == 0) && m_st == 0)) || !(2 <= \old(t1_st))) || !(token <= local)) || \old(m_st) == 0) || ((t1_st == 0 && m_st == 0) && 1 <= tmp___0)) || (((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1)) || !(E_M == M_E)) - ProcedureContractResult [Line: 328]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: ((((((t1_st == 0 && m_st == 0) || (m_st == 0 && \old(t1_st) == t1_st)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)))) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || !(token <= local)) || \old(m_st) == 0) || (t1_st == 0 && !(m_st == 0))) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || t1_st == 0) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(token <= local)) || !(t1_i == 1)) || (m_st == 1 && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(local <= token))) && ((((!(m_pc == 0) || (2 <= m_st && t1_st == 0)) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) - ProcedureContractResult [Line: 176]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1)) - ProcedureContractResult [Line: 131]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: (((((((((!(t1_pc == 1) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 275]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(local <= token)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == 2)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token))) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 158]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || (m_st == 0 && \old(t1_st) == t1_st)) || (2 <= m_st && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(2 <= E_1) - ProcedureContractResult [Line: 464]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 32]: Procedure Contract for master Derived contract for procedure master: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) - ProcedureContractResult [Line: 339]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) && (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) - ProcedureContractResult [Line: 196]: Procedure Contract for eval Derived contract for procedure eval: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - ProcedureContractResult [Line: 386]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || (((tmp <= 0 && 1 <= \result) && 0 < tmp + 1) && 1 <= __retres2)) || !(local <= token)) || !(2 <= E_1) - ProcedureContractResult [Line: 150]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 247]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == \old(M_E))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token)) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 405]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 112]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: ((((((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && (((!(m_pc == 0) || !(2 <= m_st)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1))) && (((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(m_st == 1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))) || (1 <= \result && 1 <= __retres1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 348]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(\old(M_E) == 1)) && ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(\old(M_E) == 1)) - ProcedureContractResult [Line: 376]: Procedure Contract for init_model Derived contract for procedure init_model: (((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || t1_i == 1) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) || \old(t1_i) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 103.8s, OverallIterations: 16, TraceHistogramMax: 8, AutomataDifference: 83.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 163.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4512 SDtfs, 27751 SDslu, 2679 SDs, 0 SdLazy, 30639 SolverSat, 9594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1782 GetRequests, 1113 SyntacticMatches, 2 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11282 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6220occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 9639 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 227 LocationsWithAnnotation, 42830 PreInvPairs, 45381 NumberOfFragments, 33304 HoareAnnotationTreeSize, 42830 FomulaSimplifications, 7363179199 FormulaSimplificationTreeSizeReduction, 36.8s HoareSimplificationTime, 227 FomulaSimplificationsInter, 3403011 FormulaSimplificationTreeSizeReductionInter, 125.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...