/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -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-36cd7be [2021-02-24 00:32:27,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 00:32:27,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 00:32:27,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 00:32:27,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 00:32:27,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 00:32:27,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 00:32:27,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 00:32:27,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 00:32:27,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 00:32:27,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 00:32:27,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 00:32:27,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 00:32:27,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 00:32:27,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 00:32:27,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 00:32:27,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 00:32:27,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 00:32:27,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 00:32:27,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 00:32:27,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 00:32:27,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 00:32:27,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 00:32:27,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 00:32:27,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 00:32:27,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 00:32:27,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 00:32:27,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 00:32:27,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 00:32:27,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 00:32:27,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 00:32:27,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 00:32:27,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 00:32:27,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 00:32:27,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 00:32:27,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 00:32:27,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 00:32:27,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 00:32:27,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 00:32:27,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 00:32:27,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 00:32:27,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-24 00:32:27,908 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 00:32:27,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 00:32:27,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 00:32:27,912 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 00:32:27,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 00:32:27,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 00:32:27,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 00:32:27,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 00:32:27,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 00:32:27,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 00:32:27,913 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 00:32:27,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 00:32:27,914 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 00:32:27,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 00:32:27,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 00:32:27,915 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 00:32:27,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 00:32:27,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 00:32:27,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 00:32:27,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 00:32:27,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 00:32:27,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 00:32:27,916 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-24 00:32:28,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 00:32:28,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 00:32:28,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 00:32:28,538 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 00:32:28,540 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 00:32:28,543 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-24 00:32:28,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a51a95fc/368ba149c4af4823ad269b7d31984128/FLAGf748dec98 [2021-02-24 00:32:29,574 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 00:32:29,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2021-02-24 00:32:29,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a51a95fc/368ba149c4af4823ad269b7d31984128/FLAGf748dec98 [2021-02-24 00:32:29,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a51a95fc/368ba149c4af4823ad269b7d31984128 [2021-02-24 00:32:29,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 00:32:29,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 00:32:29,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 00:32:29,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 00:32:29,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 00:32:29,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:32:29" (1/1) ... [2021-02-24 00:32:29,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63af02bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:29, skipping insertion in model container [2021-02-24 00:32:29,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:32:29" (1/1) ... [2021-02-24 00:32:29,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 00:32:29,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 00:32:30,182 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-24 00:32:30,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:32:30,277 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 00:32:30,296 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-24 00:32:30,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:32:30,375 INFO L208 MainTranslator]: Completed translation [2021-02-24 00:32:30,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30 WrapperNode [2021-02-24 00:32:30,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 00:32:30,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 00:32:30,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 00:32:30,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 00:32:30,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (1/1) ... [2021-02-24 00:32:30,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 00:32:30,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 00:32:30,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 00:32:30,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 00:32:30,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (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-24 00:32:30,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 00:32:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 00:32:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 00:32:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-24 00:32:30,608 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2021-02-24 00:32:30,608 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2021-02-24 00:32:30,609 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2021-02-24 00:32:30,609 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2021-02-24 00:32:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-24 00:32:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-24 00:32:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-24 00:32:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-24 00:32:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-24 00:32:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-24 00:32:30,614 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-24 00:32:30,614 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-02-24 00:32:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2021-02-24 00:32:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2021-02-24 00:32:30,617 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-24 00:32:30,617 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-24 00:32:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-24 00:32:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 00:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 00:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 00:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 00:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 00:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-24 00:32:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2021-02-24 00:32:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2021-02-24 00:32:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-02-24 00:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 00:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure master [2021-02-24 00:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2021-02-24 00:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-24 00:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-24 00:32:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-24 00:32:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-24 00:32:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-24 00:32:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-24 00:32:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-24 00:32:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2021-02-24 00:32:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2021-02-24 00:32:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-24 00:32:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-24 00:32:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-24 00:32:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 00:32:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 00:32:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 00:32:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 00:32:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 00:32:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 00:32:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 00:32:31,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 00:32:31,574 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-24 00:32:31,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:32:31 BoogieIcfgContainer [2021-02-24 00:32:31,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 00:32:31,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 00:32:31,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 00:32:31,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 00:32:31,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:32:29" (1/3) ... [2021-02-24 00:32:31,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115e896b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:32:31, skipping insertion in model container [2021-02-24 00:32:31,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:30" (2/3) ... [2021-02-24 00:32:31,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115e896b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:32:31, skipping insertion in model container [2021-02-24 00:32:31,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:32:31" (3/3) ... [2021-02-24 00:32:31,597 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-02-24 00:32:31,611 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 00:32:31,621 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 00:32:31,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 00:32:31,696 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 00:32:31,697 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 00:32:31,697 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-24 00:32:31,698 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 00:32:31,698 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 00:32:31,698 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 00:32:31,699 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 00:32:31,699 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 00:32:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2021-02-24 00:32:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-02-24 00:32:31,753 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:31,755 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-24 00:32:31,756 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:31,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1623549773, now seen corresponding path program 1 times [2021-02-24 00:32:31,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:31,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812582388] [2021-02-24 00:32:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,295 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,298 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,324 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,326 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,327 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,328 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,330 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,331 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,332 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,566 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,568 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,594 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,595 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,629 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,630 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,674 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,696 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:32,821 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-24 00:32:32,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812582388] [2021-02-24 00:32:32,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:32,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-24 00:32:32,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650706848] [2021-02-24 00:32:32,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-24 00:32:32,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-24 00:32:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-02-24 00:32:32,865 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 7 states. [2021-02-24 00:32:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:36,168 INFO L93 Difference]: Finished difference Result 782 states and 1043 transitions. [2021-02-24 00:32:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-24 00:32:36,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2021-02-24 00:32:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:36,199 INFO L225 Difference]: With dead ends: 782 [2021-02-24 00:32:36,199 INFO L226 Difference]: Without dead ends: 580 [2021-02-24 00:32:36,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:32:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-02-24 00:32:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 399. [2021-02-24 00:32:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2021-02-24 00:32:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 483 transitions. [2021-02-24 00:32:36,467 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 483 transitions. Word has length 115 [2021-02-24 00:32:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:36,469 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 483 transitions. [2021-02-24 00:32:36,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-24 00:32:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 483 transitions. [2021-02-24 00:32:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-02-24 00:32:36,476 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:36,477 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-24 00:32:36,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 00:32:36,478 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 686750457, now seen corresponding path program 1 times [2021-02-24 00:32:36,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:36,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552327925] [2021-02-24 00:32:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,708 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,727 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,728 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,730 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,731 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,732 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,733 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,734 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,825 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,826 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,862 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,897 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,898 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,898 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,974 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,975 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,981 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,994 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:37,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:37,088 WARN L141 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-02-24 00:32:37,091 WARN L147 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size 14 [2021-02-24 00:32:37,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:32:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,141 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,142 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:37,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:37,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:37,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,185 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:37,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-02-24 00:32:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:37,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:37,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-02-24 00:32:37,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552327925] [2021-02-24 00:32:37,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:37,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-24 00:32:37,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717870533] [2021-02-24 00:32:37,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-24 00:32:37,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-24 00:32:37,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-02-24 00:32:37,293 INFO L87 Difference]: Start difference. First operand 399 states and 483 transitions. Second operand 10 states. [2021-02-24 00:32:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:41,120 INFO L93 Difference]: Finished difference Result 1534 states and 2102 transitions. [2021-02-24 00:32:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-24 00:32:41,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2021-02-24 00:32:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:41,140 INFO L225 Difference]: With dead ends: 1534 [2021-02-24 00:32:41,140 INFO L226 Difference]: Without dead ends: 1183 [2021-02-24 00:32:41,147 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-24 00:32:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-02-24 00:32:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 762. [2021-02-24 00:32:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2021-02-24 00:32:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 960 transitions. [2021-02-24 00:32:41,455 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 960 transitions. Word has length 178 [2021-02-24 00:32:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:41,457 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 960 transitions. [2021-02-24 00:32:41,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-24 00:32:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 960 transitions. [2021-02-24 00:32:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-02-24 00:32:41,463 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:41,464 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-24 00:32:41,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 00:32:41,465 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash -729428327, now seen corresponding path program 1 times [2021-02-24 00:32:41,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:41,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393399546] [2021-02-24 00:32:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,544 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,545 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,546 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:41,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,559 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,644 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,646 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:32:41,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,697 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:32:41,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,732 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,747 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:32:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,812 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,825 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,826 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,831 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,832 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-02-24 00:32:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,847 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-02-24 00:32:41,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393399546] [2021-02-24 00:32:41,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:41,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-24 00:32:41,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644507264] [2021-02-24 00:32:41,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-24 00:32:41,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:41,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-24 00:32:41,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-24 00:32:41,890 INFO L87 Difference]: Start difference. First operand 762 states and 960 transitions. Second operand 9 states. [2021-02-24 00:32:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:44,594 INFO L93 Difference]: Finished difference Result 1786 states and 2317 transitions. [2021-02-24 00:32:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-24 00:32:44,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2021-02-24 00:32:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:44,611 INFO L225 Difference]: With dead ends: 1786 [2021-02-24 00:32:44,611 INFO L226 Difference]: Without dead ends: 1070 [2021-02-24 00:32:44,615 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-24 00:32:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-02-24 00:32:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 756. [2021-02-24 00:32:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2021-02-24 00:32:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 949 transitions. [2021-02-24 00:32:44,857 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 949 transitions. Word has length 178 [2021-02-24 00:32:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:44,858 INFO L480 AbstractCegarLoop]: Abstraction has 756 states and 949 transitions. [2021-02-24 00:32:44,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-24 00:32:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 949 transitions. [2021-02-24 00:32:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-02-24 00:32:44,868 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:44,869 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-24 00:32:44,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 00:32:44,871 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:44,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1363211102, now seen corresponding path program 1 times [2021-02-24 00:32:44,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:44,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043090210] [2021-02-24 00:32:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:44,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:45,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:45,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:45,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:32:45,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,150 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,151 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,153 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:32:45,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,173 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,179 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,180 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,207 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,208 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,237 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,250 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,255 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,256 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,262 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,276 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,330 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,332 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,334 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:45,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:32:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,370 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,372 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,378 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,384 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-24 00:32:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:45,401 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:45,403 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:45,404 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-02-24 00:32:45,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043090210] [2021-02-24 00:32:45,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:45,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-24 00:32:45,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462409725] [2021-02-24 00:32:45,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:32:45,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:45,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:32:45,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:32:45,510 INFO L87 Difference]: Start difference. First operand 756 states and 949 transitions. Second operand 11 states. [2021-02-24 00:32:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:54,089 INFO L93 Difference]: Finished difference Result 4457 states and 6049 transitions. [2021-02-24 00:32:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-02-24 00:32:54,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2021-02-24 00:32:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:54,135 INFO L225 Difference]: With dead ends: 4457 [2021-02-24 00:32:54,135 INFO L226 Difference]: Without dead ends: 3746 [2021-02-24 00:32:54,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2021-02-24 00:32:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2021-02-24 00:32:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 2959. [2021-02-24 00:32:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2021-02-24 00:32:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3738 transitions. [2021-02-24 00:32:55,104 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3738 transitions. Word has length 183 [2021-02-24 00:32:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:55,105 INFO L480 AbstractCegarLoop]: Abstraction has 2959 states and 3738 transitions. [2021-02-24 00:32:55,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:32:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3738 transitions. [2021-02-24 00:32:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-02-24 00:32:55,116 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:55,116 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-24 00:32:55,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 00:32:55,117 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash 289955978, now seen corresponding path program 1 times [2021-02-24 00:32:55,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:55,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739257398] [2021-02-24 00:32:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,257 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,270 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,274 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,311 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,325 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,326 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,331 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,333 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,338 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,339 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,344 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,344 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,384 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:32:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,395 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,408 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,409 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,410 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:55,423 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-24 00:32:55,424 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-24 00:32:55,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,446 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,447 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,448 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,448 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:55,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,468 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:55,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:32:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-02-24 00:32:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,548 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,550 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:32:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,568 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,569 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,575 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:32:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-02-24 00:32:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:55,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:55,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-02-24 00:32:55,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739257398] [2021-02-24 00:32:55,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:32:55,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-24 00:32:55,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579142337] [2021-02-24 00:32:55,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:32:55,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:55,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:32:55,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:32:55,658 INFO L87 Difference]: Start difference. First operand 2959 states and 3738 transitions. Second operand 12 states. [2021-02-24 00:32:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:59,586 INFO L93 Difference]: Finished difference Result 6447 states and 8413 transitions. [2021-02-24 00:32:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-24 00:32:59,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2021-02-24 00:32:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:59,616 INFO L225 Difference]: With dead ends: 6447 [2021-02-24 00:32:59,616 INFO L226 Difference]: Without dead ends: 3223 [2021-02-24 00:32:59,637 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-24 00:32:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2021-02-24 00:33:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2413. [2021-02-24 00:33:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2021-02-24 00:33:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 2983 transitions. [2021-02-24 00:33:00,305 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 2983 transitions. Word has length 227 [2021-02-24 00:33:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:00,306 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 2983 transitions. [2021-02-24 00:33:00,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:33:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2983 transitions. [2021-02-24 00:33:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-02-24 00:33:00,313 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:00,313 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-24 00:33:00,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 00:33:00,314 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1002674610, now seen corresponding path program 1 times [2021-02-24 00:33:00,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:00,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792260814] [2021-02-24 00:33:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,380 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,381 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,388 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,389 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,469 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,484 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,485 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,525 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,533 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,542 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,542 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,547 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,548 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,551 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,551 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:33:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,585 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:33:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,592 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,593 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,597 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,598 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,601 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,602 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,607 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-24 00:33:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,636 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,637 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,646 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:00,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,679 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:00,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,685 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,686 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,695 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:33:00,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-02-24 00:33:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-02-24 00:33:00,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [792260814] [2021-02-24 00:33:00,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:00,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-24 00:33:00,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118006016] [2021-02-24 00:33:00,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:33:00,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:33:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:33:00,848 INFO L87 Difference]: Start difference. First operand 2413 states and 2983 transitions. Second operand 11 states. [2021-02-24 00:33:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:05,368 INFO L93 Difference]: Finished difference Result 6904 states and 8959 transitions. [2021-02-24 00:33:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-02-24 00:33:05,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2021-02-24 00:33:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:05,420 INFO L225 Difference]: With dead ends: 6904 [2021-02-24 00:33:05,421 INFO L226 Difference]: Without dead ends: 4536 [2021-02-24 00:33:05,517 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-24 00:33:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2021-02-24 00:33:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3623. [2021-02-24 00:33:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2021-02-24 00:33:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4393 transitions. [2021-02-24 00:33:06,778 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4393 transitions. Word has length 227 [2021-02-24 00:33:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:06,779 INFO L480 AbstractCegarLoop]: Abstraction has 3623 states and 4393 transitions. [2021-02-24 00:33:06,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:33:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4393 transitions. [2021-02-24 00:33:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-02-24 00:33:06,792 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:06,793 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-24 00:33:06,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 00:33:06,794 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -886783072, now seen corresponding path program 1 times [2021-02-24 00:33:06,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:06,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173112553] [2021-02-24 00:33:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:06,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:06,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:06,864 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:06,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:06,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:06,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:06,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:06,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:06,973 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,974 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:06,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:06,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:06,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:06,996 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:06,997 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,020 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,044 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,056 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,057 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:33:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:33:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,139 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-24 00:33:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,171 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,172 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,174 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,177 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:07,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-02-24 00:33:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,192 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,193 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:07,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-02-24 00:33:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,232 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,233 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,246 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,253 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,265 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,266 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,270 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-02-24 00:33:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:07,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:07,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-02-24 00:33:07,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173112553] [2021-02-24 00:33:07,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:07,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-24 00:33:07,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982107716] [2021-02-24 00:33:07,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:33:07,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:33:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:33:07,363 INFO L87 Difference]: Start difference. First operand 3623 states and 4393 transitions. Second operand 12 states. [2021-02-24 00:33:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:16,139 INFO L93 Difference]: Finished difference Result 7008 states and 8626 transitions. [2021-02-24 00:33:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-02-24 00:33:16,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 256 [2021-02-24 00:33:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:16,177 INFO L225 Difference]: With dead ends: 7008 [2021-02-24 00:33:16,177 INFO L226 Difference]: Without dead ends: 4569 [2021-02-24 00:33:16,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2021-02-24 00:33:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2021-02-24 00:33:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 3665. [2021-02-24 00:33:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2021-02-24 00:33:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4341 transitions. [2021-02-24 00:33:17,372 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4341 transitions. Word has length 256 [2021-02-24 00:33:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:17,373 INFO L480 AbstractCegarLoop]: Abstraction has 3665 states and 4341 transitions. [2021-02-24 00:33:17,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:33:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4341 transitions. [2021-02-24 00:33:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-24 00:33:17,384 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:17,385 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-24 00:33:17,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 00:33:17,385 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:17,386 INFO L82 PathProgramCache]: Analyzing trace with hash -429549839, now seen corresponding path program 1 times [2021-02-24 00:33:17,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:17,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632065425] [2021-02-24 00:33:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,469 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,473 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,474 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,475 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,476 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,476 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,477 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,477 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:17,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,560 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,560 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:17,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,578 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,599 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,620 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,621 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,641 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,641 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,654 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-24 00:33:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-24 00:33:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,685 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,685 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-24 00:33:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,718 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:33:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,735 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,744 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,745 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-24 00:33:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:17,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,771 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,772 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,791 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,804 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,817 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,821 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,822 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:17,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-02-24 00:33:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:17,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:17,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-02-24 00:33:17,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632065425] [2021-02-24 00:33:17,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:17,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-24 00:33:17,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900080280] [2021-02-24 00:33:17,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-24 00:33:17,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:17,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-24 00:33:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:33:17,915 INFO L87 Difference]: Start difference. First operand 3665 states and 4341 transitions. Second operand 17 states. [2021-02-24 00:33:19,616 WARN L202 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-02-24 00:33:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:30,328 INFO L93 Difference]: Finished difference Result 8410 states and 10544 transitions. [2021-02-24 00:33:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-02-24 00:33:30,329 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 262 [2021-02-24 00:33:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:30,381 INFO L225 Difference]: With dead ends: 8410 [2021-02-24 00:33:30,382 INFO L226 Difference]: Without dead ends: 4789 [2021-02-24 00:33:30,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2021-02-24 00:33:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2021-02-24 00:33:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 3673. [2021-02-24 00:33:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2021-02-24 00:33:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4248 transitions. [2021-02-24 00:33:31,526 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4248 transitions. Word has length 262 [2021-02-24 00:33:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:31,528 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4248 transitions. [2021-02-24 00:33:31,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-24 00:33:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4248 transitions. [2021-02-24 00:33:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-24 00:33:31,535 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:31,536 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-24 00:33:31,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 00:33:31,536 INFO L428 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:31,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1900844140, now seen corresponding path program 1 times [2021-02-24 00:33:31,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:31,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068309248] [2021-02-24 00:33:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,618 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,619 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,621 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,622 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:31,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 00:33:31,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:31,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,750 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,785 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,786 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,798 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,807 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,808 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-24 00:33:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,833 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-24 00:33:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-24 00:33:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,881 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:31,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:33:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,894 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,895 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,902 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-24 00:33:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:31,957 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,959 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 00:33:31,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:31,993 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:31,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:31,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-02-24 00:33:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:32,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:32,021 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-02-24 00:33:32,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068309248] [2021-02-24 00:33:32,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:32,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-24 00:33:32,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412417043] [2021-02-24 00:33:32,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:33:32,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:32,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:33:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:33:32,218 INFO L87 Difference]: Start difference. First operand 3673 states and 4248 transitions. Second operand 12 states. [2021-02-24 00:33:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:41,700 INFO L93 Difference]: Finished difference Result 10320 states and 12285 transitions. [2021-02-24 00:33:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-02-24 00:33:41,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2021-02-24 00:33:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:41,777 INFO L225 Difference]: With dead ends: 10320 [2021-02-24 00:33:41,777 INFO L226 Difference]: Without dead ends: 7589 [2021-02-24 00:33:41,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2021-02-24 00:33:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7589 states. [2021-02-24 00:33:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7589 to 6220. [2021-02-24 00:33:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2021-02-24 00:33:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 7325 transitions. [2021-02-24 00:33:43,898 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 7325 transitions. Word has length 262 [2021-02-24 00:33:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:43,899 INFO L480 AbstractCegarLoop]: Abstraction has 6220 states and 7325 transitions. [2021-02-24 00:33:43,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:33:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 7325 transitions. [2021-02-24 00:33:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-02-24 00:33:43,914 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:43,915 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-24 00:33:43,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-24 00:33:43,916 INFO L428 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash -758707222, now seen corresponding path program 1 times [2021-02-24 00:33:43,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:43,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1233627767] [2021-02-24 00:33:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:43,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:43,984 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:43,990 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:43,991 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:43,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:43,993 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:43,994 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:43,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:43,996 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:43,997 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:44,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,181 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,189 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,196 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,203 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:33:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,265 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,266 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,267 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:44,282 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,283 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:44,295 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,296 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,299 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,300 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-24 00:33:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,339 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,340 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:33:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,356 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,357 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,363 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,364 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,369 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-24 00:33:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:44,405 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:44,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-02-24 00:33:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-02-24 00:33:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,440 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-02-24 00:33:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-02-24 00:33:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,465 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,466 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-02-24 00:33:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-02-24 00:33:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,480 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,484 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,485 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-02-24 00:33:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:44,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:44,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-02-24 00:33:44,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1233627767] [2021-02-24 00:33:44,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:44,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-02-24 00:33:44,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953136653] [2021-02-24 00:33:44,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-24 00:33:44,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-24 00:33:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-24 00:33:44,549 INFO L87 Difference]: Start difference. First operand 6220 states and 7325 transitions. Second operand 13 states. [2021-02-24 00:33:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:49,954 INFO L93 Difference]: Finished difference Result 10838 states and 12762 transitions. [2021-02-24 00:33:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-24 00:33:49,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 283 [2021-02-24 00:33:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:49,988 INFO L225 Difference]: With dead ends: 10838 [2021-02-24 00:33:49,988 INFO L226 Difference]: Without dead ends: 4664 [2021-02-24 00:33:50,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2021-02-24 00:33:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2021-02-24 00:33:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 3928. [2021-02-24 00:33:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2021-02-24 00:33:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 4551 transitions. [2021-02-24 00:33:50,994 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 4551 transitions. Word has length 283 [2021-02-24 00:33:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:50,995 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 4551 transitions. [2021-02-24 00:33:50,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-24 00:33:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 4551 transitions. [2021-02-24 00:33:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2021-02-24 00:33:51,004 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:51,004 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-24 00:33:51,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-24 00:33:51,005 INFO L428 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1388894635, now seen corresponding path program 1 times [2021-02-24 00:33:51,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:51,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1848621841] [2021-02-24 00:33:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,079 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,079 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,080 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,080 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,080 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:51,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:51,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:51,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,178 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,180 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,180 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,214 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,214 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,265 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:51,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,287 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,291 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,292 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,294 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,295 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,301 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,303 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,303 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:51,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:33:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,410 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,440 WARN L141 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size [2021-02-24 00:33:51,441 WARN L147 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size 7 [2021-02-24 00:33:51,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,461 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-24 00:33:51,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-24 00:33:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,548 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,549 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:33:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,555 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,561 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,562 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,565 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,566 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-24 00:33:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,612 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-24 00:33:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,620 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,623 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-24 00:33:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-24 00:33:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,642 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:51,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-24 00:33:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:51,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,677 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:51,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,682 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-02-24 00:33:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,689 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,689 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-02-24 00:33:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,694 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-02-24 00:33:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,702 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,703 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-02-24 00:33:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:51,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:51,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 14 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-02-24 00:33:51,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1848621841] [2021-02-24 00:33:51,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:51,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-02-24 00:33:51,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336689233] [2021-02-24 00:33:51,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-24 00:33:51,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-24 00:33:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:33:51,828 INFO L87 Difference]: Start difference. First operand 3928 states and 4551 transitions. Second operand 17 states. [2021-02-24 00:33:52,265 WARN L202 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2021-02-24 00:33:53,516 WARN L202 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-02-24 00:34:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:03,301 INFO L93 Difference]: Finished difference Result 10083 states and 12373 transitions. [2021-02-24 00:34:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-02-24 00:34:03,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 292 [2021-02-24 00:34:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:03,367 INFO L225 Difference]: With dead ends: 10083 [2021-02-24 00:34:03,368 INFO L226 Difference]: Without dead ends: 6205 [2021-02-24 00:34:03,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1306, Invalid=5336, Unknown=0, NotChecked=0, Total=6642 [2021-02-24 00:34:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6205 states. [2021-02-24 00:34:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6205 to 4919. [2021-02-24 00:34:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4919 states. [2021-02-24 00:34:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 5548 transitions. [2021-02-24 00:34:04,751 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 5548 transitions. Word has length 292 [2021-02-24 00:34:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:04,752 INFO L480 AbstractCegarLoop]: Abstraction has 4919 states and 5548 transitions. [2021-02-24 00:34:04,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-24 00:34:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 5548 transitions. [2021-02-24 00:34:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2021-02-24 00:34:04,762 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:04,763 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-24 00:34:04,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-24 00:34:04,763 INFO L428 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:04,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2026275409, now seen corresponding path program 1 times [2021-02-24 00:34:04,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:04,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384224209] [2021-02-24 00:34:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,833 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,834 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,891 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,891 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,902 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:34:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,904 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,904 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,924 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:34:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,944 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,946 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,947 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:34:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,952 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,953 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:34:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:04,993 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:04,994 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:04,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:05,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-24 00:34:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,026 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-24 00:34:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,060 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,061 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:05,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:34:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,066 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,077 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-02-24 00:34:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:05,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:34:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,102 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:34:05,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:34:05,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,116 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:34:05,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-02-24 00:34:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-02-24 00:34:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,153 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-02-24 00:34:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,156 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-02-24 00:34:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,165 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,168 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-02-24 00:34:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,172 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-02-24 00:34:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-02-24 00:34:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,179 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,182 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-24 00:34:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,185 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-02-24 00:34:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,192 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:34:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,196 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,201 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,204 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:34:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,207 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,207 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-02-24 00:34:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:05,212 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:05,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 118 proven. 37 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-02-24 00:34:05,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384224209] [2021-02-24 00:34:05,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:34:05,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-02-24 00:34:05,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920163674] [2021-02-24 00:34:05,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:34:05,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:34:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:34:05,374 INFO L87 Difference]: Start difference. First operand 4919 states and 5548 transitions. Second operand 11 states. [2021-02-24 00:34:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:08,647 INFO L93 Difference]: Finished difference Result 9577 states and 11061 transitions. [2021-02-24 00:34:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-24 00:34:08,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 427 [2021-02-24 00:34:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:08,670 INFO L225 Difference]: With dead ends: 9577 [2021-02-24 00:34:08,670 INFO L226 Difference]: Without dead ends: 4878 [2021-02-24 00:34:08,684 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-24 00:34:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-02-24 00:34:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4497. [2021-02-24 00:34:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4497 states. [2021-02-24 00:34:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 5019 transitions. [2021-02-24 00:34:09,743 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 5019 transitions. Word has length 427 [2021-02-24 00:34:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:09,744 INFO L480 AbstractCegarLoop]: Abstraction has 4497 states and 5019 transitions. [2021-02-24 00:34:09,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:34:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 5019 transitions. [2021-02-24 00:34:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-02-24 00:34:09,753 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:09,754 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-24 00:34:09,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-24 00:34:09,754 INFO L428 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash 579786324, now seen corresponding path program 1 times [2021-02-24 00:34:09,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:09,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684772258] [2021-02-24 00:34:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:09,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:09,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:09,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,820 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,821 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,885 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,885 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:09,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,897 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,897 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:34:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:34:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,931 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:34:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:34:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,986 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,987 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:09,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:09,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:09,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-24 00:34:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-24 00:34:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,016 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,016 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:34:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,056 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-02-24 00:34:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:10,082 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,083 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,083 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:34:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,089 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:10,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:10,118 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,119 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:10,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:10,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,153 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-24 00:34:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,158 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-02-24 00:34:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,186 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-02-24 00:34:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,190 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,191 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-02-24 00:34:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,200 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,202 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,203 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-02-24 00:34:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,206 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,207 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-02-24 00:34:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-02-24 00:34:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,214 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,215 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,218 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-02-24 00:34:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-02-24 00:34:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,229 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:34:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,234 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,235 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,240 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,244 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,244 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:34:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,247 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2021-02-24 00:34:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:10,254 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:10,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 108 proven. 37 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2021-02-24 00:34:10,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684772258] [2021-02-24 00:34:10,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:34:10,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-02-24 00:34:10,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054331225] [2021-02-24 00:34:10,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-24 00:34:10,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-24 00:34:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-02-24 00:34:10,557 INFO L87 Difference]: Start difference. First operand 4497 states and 5019 transitions. Second operand 15 states. [2021-02-24 00:34:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:15,062 INFO L93 Difference]: Finished difference Result 6016 states and 6733 transitions. [2021-02-24 00:34:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-02-24 00:34:15,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 429 [2021-02-24 00:34:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:15,072 INFO L225 Difference]: With dead ends: 6016 [2021-02-24 00:34:15,072 INFO L226 Difference]: Without dead ends: 1789 [2021-02-24 00:34:15,082 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-24 00:34:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2021-02-24 00:34:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1587. [2021-02-24 00:34:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2021-02-24 00:34:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1722 transitions. [2021-02-24 00:34:15,630 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1722 transitions. Word has length 429 [2021-02-24 00:34:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:15,631 INFO L480 AbstractCegarLoop]: Abstraction has 1587 states and 1722 transitions. [2021-02-24 00:34:15,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-24 00:34:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1722 transitions. [2021-02-24 00:34:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-02-24 00:34:15,637 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:15,638 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-24 00:34:15,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-24 00:34:15,638 INFO L428 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1823099586, now seen corresponding path program 1 times [2021-02-24 00:34:15,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:15,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038403771] [2021-02-24 00:34:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,700 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,701 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:15,703 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,704 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,763 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,764 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:34:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,776 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,788 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:34:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,813 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,813 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,816 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:34:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:34:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,852 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-24 00:34:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:34:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,881 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,885 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,885 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,887 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,888 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,890 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,890 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-24 00:34:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,913 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-24 00:34:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-24 00:34:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,924 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,924 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-24 00:34:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-24 00:34:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,934 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,934 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-24 00:34:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-24 00:34:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-24 00:34:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,955 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:34:15,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-24 00:34:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,961 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,964 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-24 00:34:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,973 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:15,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-02-24 00:34:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,984 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,985 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-02-24 00:34:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,993 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,993 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,996 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,996 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2021-02-24 00:34:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:15,998 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:15,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:15,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-02-24 00:34:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-02-24 00:34:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,007 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:34:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-02-24 00:34:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,016 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,017 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2021-02-24 00:34:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,020 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2021-02-24 00:34:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,024 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2021-02-24 00:34:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:16,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:16,030 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2021-02-24 00:34:16,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038403771] [2021-02-24 00:34:16,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:34:16,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-24 00:34:16,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792436948] [2021-02-24 00:34:16,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:34:16,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:16,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:34:16,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:34:16,196 INFO L87 Difference]: Start difference. First operand 1587 states and 1722 transitions. Second operand 12 states. [2021-02-24 00:34:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:19,264 INFO L93 Difference]: Finished difference Result 2871 states and 3123 transitions. [2021-02-24 00:34:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-02-24 00:34:19,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 437 [2021-02-24 00:34:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:19,275 INFO L225 Difference]: With dead ends: 2871 [2021-02-24 00:34:19,276 INFO L226 Difference]: Without dead ends: 1554 [2021-02-24 00:34:19,280 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-24 00:34:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-02-24 00:34:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1451. [2021-02-24 00:34:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2021-02-24 00:34:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1558 transitions. [2021-02-24 00:34:19,765 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1558 transitions. Word has length 437 [2021-02-24 00:34:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:19,766 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 1558 transitions. [2021-02-24 00:34:19,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:34:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1558 transitions. [2021-02-24 00:34:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-02-24 00:34:19,770 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:19,771 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-24 00:34:19,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-24 00:34:19,771 INFO L428 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:19,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1496415247, now seen corresponding path program 1 times [2021-02-24 00:34:19,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:19,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586516956] [2021-02-24 00:34:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,828 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,831 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,886 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,887 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,897 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:34:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,898 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,898 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,909 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:34:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,924 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:34:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,943 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:34:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,975 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:19,976 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:19,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-24 00:34:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:19,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:34:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,008 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-24 00:34:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,039 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-24 00:34:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,041 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,042 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-24 00:34:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,051 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-24 00:34:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,056 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-24 00:34:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,060 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,061 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,063 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,064 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-24 00:34:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-24 00:34:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-24 00:34:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-24 00:34:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-24 00:34:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,100 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-02-24 00:34:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:20,122 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-24 00:34:20,123 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-24 00:34:20,135 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,135 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,140 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,141 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,142 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,143 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:20,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:34:20,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-02-24 00:34:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,178 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-02-24 00:34:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,180 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,180 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-02-24 00:34:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,183 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,184 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-24 00:34:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,190 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,193 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:34:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-02-24 00:34:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,201 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-02-24 00:34:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,204 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-02-24 00:34:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,207 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,208 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-02-24 00:34:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:20,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:20,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2021-02-24 00:34:20,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586516956] [2021-02-24 00:34:20,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:34:20,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-02-24 00:34:20,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523449778] [2021-02-24 00:34:20,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-02-24 00:34:20,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-02-24 00:34:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-02-24 00:34:20,437 INFO L87 Difference]: Start difference. First operand 1451 states and 1558 transitions. Second operand 14 states. [2021-02-24 00:34:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:23,223 INFO L93 Difference]: Finished difference Result 2745 states and 2966 transitions. [2021-02-24 00:34:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-24 00:34:23,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 438 [2021-02-24 00:34:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:23,230 INFO L225 Difference]: With dead ends: 2745 [2021-02-24 00:34:23,231 INFO L226 Difference]: Without dead ends: 1564 [2021-02-24 00:34:23,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2021-02-24 00:34:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2021-02-24 00:34:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1448. [2021-02-24 00:34:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2021-02-24 00:34:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1552 transitions. [2021-02-24 00:34:23,699 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1552 transitions. Word has length 438 [2021-02-24 00:34:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:23,699 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 1552 transitions. [2021-02-24 00:34:23,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-02-24 00:34:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1552 transitions. [2021-02-24 00:34:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-02-24 00:34:23,702 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:34:23,703 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-24 00:34:23,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-02-24 00:34:23,703 INFO L428 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:34:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:34:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1033013137, now seen corresponding path program 1 times [2021-02-24 00:34:23,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:34:23,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989041239] [2021-02-24 00:34:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:34:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:23,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:23,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:23,767 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,767 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,768 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:23,771 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,772 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:34:23,777 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,848 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,849 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:23,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:34:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:34:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:34:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:34:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,899 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:34:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,903 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,903 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,905 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,906 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:34:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-24 00:34:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,947 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-24 00:34:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-24 00:34:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,981 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:34:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,986 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,989 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:23,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:34:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:23,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:23,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-24 00:34:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-24 00:34:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,024 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-24 00:34:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,035 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,035 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-24 00:34:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,038 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-24 00:34:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,041 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,042 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,044 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-24 00:34:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,049 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,049 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-24 00:34:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,051 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-24 00:34:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,065 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-24 00:34:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,069 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,070 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:34:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-24 00:34:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-02-24 00:34:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,082 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,083 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:24,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,093 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:34:24,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-02-24 00:34:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-02-24 00:34:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,119 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-02-24 00:34:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,122 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-24 00:34:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,129 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:34:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,130 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,131 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-02-24 00:34:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,140 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-02-24 00:34:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,143 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,144 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-02-24 00:34:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:34:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-02-24 00:34:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:34:24,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:34:24,152 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:34:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2021-02-24 00:34:24,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989041239] [2021-02-24 00:34:24,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:34:24,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-02-24 00:34:24,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280599343] [2021-02-24 00:34:24,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-24 00:34:24,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:34:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-24 00:34:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-02-24 00:34:24,355 INFO L87 Difference]: Start difference. First operand 1448 states and 1552 transitions. Second operand 15 states. [2021-02-24 00:34:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:34:27,519 INFO L93 Difference]: Finished difference Result 2281 states and 2451 transitions. [2021-02-24 00:34:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-02-24 00:34:27,520 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 438 [2021-02-24 00:34:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:34:27,522 INFO L225 Difference]: With dead ends: 2281 [2021-02-24 00:34:27,522 INFO L226 Difference]: Without dead ends: 0 [2021-02-24 00:34:27,529 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-24 00:34:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-24 00:34:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-24 00:34:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-24 00:34:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-24 00:34:27,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 438 [2021-02-24 00:34:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:34:27,531 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-24 00:34:27,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-24 00:34:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-24 00:34:27,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-24 00:34:27,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-02-24 00:34:27,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-24 00:34:28,665 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2021-02-24 00:34:28,907 WARN L202 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2021-02-24 00:34:29,753 WARN L202 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2021-02-24 00:34:30,026 WARN L202 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2021-02-24 00:34:30,371 WARN L202 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 116 [2021-02-24 00:34:31,143 WARN L202 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2021-02-24 00:34:31,853 WARN L202 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2021-02-24 00:34:32,176 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-02-24 00:34:32,285 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-02-24 00:34:32,945 WARN L202 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-02-24 00:34:37,272 WARN L202 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2021-02-24 00:34:37,405 WARN L202 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2021-02-24 00:34:37,567 WARN L202 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 105 [2021-02-24 00:34:37,707 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 44 [2021-02-24 00:34:39,252 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 140 [2021-02-24 00:34:42,167 WARN L202 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2021-02-24 00:34:42,384 WARN L202 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2021-02-24 00:34:42,637 WARN L202 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2021-02-24 00:34:44,488 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2021-02-24 00:34:44,698 WARN L202 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2021-02-24 00:34:44,955 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2021-02-24 00:34:45,371 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 117 [2021-02-24 00:34:45,474 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 119 [2021-02-24 00:34:45,662 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 119 [2021-02-24 00:34:45,844 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2021-02-24 00:34:45,963 WARN L202 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2021-02-24 00:34:46,647 WARN L202 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 140 [2021-02-24 00:34:49,972 WARN L202 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-02-24 00:34:50,421 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2021-02-24 00:34:53,050 WARN L202 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-02-24 00:34:56,565 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2021-02-24 00:34:56,675 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2021-02-24 00:34:56,885 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2021-02-24 00:34:56,995 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2021-02-24 00:34:57,129 WARN L202 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2021-02-24 00:34:57,238 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2021-02-24 00:34:57,771 WARN L202 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-24 00:34:57,916 WARN L202 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-24 00:34:58,197 WARN L202 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-24 00:34:58,340 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-24 00:34:58,529 WARN L202 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-24 00:34:58,659 WARN L202 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-24 00:35:00,611 WARN L202 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-24 00:35:00,740 WARN L202 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-24 00:35:01,041 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-24 00:35:01,188 WARN L202 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-24 00:35:01,376 WARN L202 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-24 00:35:01,508 WARN L202 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-24 00:35:06,909 WARN L202 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-02-24 00:35:07,154 WARN L202 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2021-02-24 00:35:08,408 WARN L202 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-24 00:35:09,766 WARN L202 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 166 DAG size of output: 80 [2021-02-24 00:35:10,782 WARN L202 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2021-02-24 00:35:11,597 WARN L202 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 55 [2021-02-24 00:35:12,720 WARN L202 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 162 DAG size of output: 89 [2021-02-24 00:35:12,967 WARN L202 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 38 [2021-02-24 00:35:14,882 WARN L202 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2021-02-24 00:35:16,888 WARN L202 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2021-02-24 00:35:17,089 WARN L202 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-24 00:35:18,016 WARN L202 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-24 00:35:18,589 WARN L202 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2021-02-24 00:35:18,852 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2021-02-24 00:35:19,027 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2021-02-24 00:35:20,663 WARN L202 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 133 DAG size of output: 70 [2021-02-24 00:35:22,478 WARN L202 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2021-02-24 00:35:22,922 WARN L202 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2021-02-24 00:35:23,182 WARN L202 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2021-02-24 00:35:23,716 WARN L202 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2021-02-24 00:35:23,989 WARN L202 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 38 [2021-02-24 00:35:24,417 WARN L202 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-02-24 00:35:24,597 WARN L202 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-02-24 00:35:24,803 WARN L202 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-24 00:35:24,926 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-24 00:35:25,241 WARN L202 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-24 00:35:25,365 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-24 00:35:25,587 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2021-02-24 00:35:25,796 WARN L202 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-24 00:35:26,011 WARN L202 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2021-02-24 00:35:27,097 WARN L202 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2021-02-24 00:35:27,491 WARN L202 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2021-02-24 00:35:28,205 WARN L202 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2021-02-24 00:35:28,926 WARN L202 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2021-02-24 00:35:29,410 WARN L202 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2021-02-24 00:35:29,634 WARN L202 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2021-02-24 00:35:30,011 WARN L202 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-02-24 00:35:31,007 WARN L202 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2021-02-24 00:35:32,168 WARN L202 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 127 DAG size of output: 69 [2021-02-24 00:35:32,650 WARN L202 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2021-02-24 00:35:33,373 WARN L202 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-24 00:35:35,225 WARN L202 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2021-02-24 00:35:36,052 WARN L202 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2021-02-24 00:35:36,623 WARN L202 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-24 00:35:37,118 WARN L202 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-24 00:35:37,321 WARN L202 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2021-02-24 00:35:37,921 WARN L202 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 45 [2021-02-24 00:35:38,292 WARN L202 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2021-02-24 00:35:38,500 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-24 00:35:38,707 WARN L202 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-24 00:35:39,078 WARN L202 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-02-24 00:35:39,281 WARN L202 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-24 00:35:39,872 WARN L202 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 45 [2021-02-24 00:35:41,882 WARN L202 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 188 DAG size of output: 91 [2021-02-24 00:35:43,110 WARN L202 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-24 00:35:43,443 WARN L202 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2021-02-24 00:35:44,485 WARN L202 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 120 DAG size of output: 59 [2021-02-24 00:35:45,556 WARN L202 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2021-02-24 00:35:45,767 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2021-02-24 00:35:47,280 WARN L202 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 149 DAG size of output: 87 [2021-02-24 00:35:48,661 WARN L202 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2021-02-24 00:35:49,047 WARN L202 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2021-02-24 00:35:50,421 WARN L202 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2021-02-24 00:35:50,711 WARN L202 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 40 [2021-02-24 00:35:50,835 WARN L202 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2021-02-24 00:35:51,518 WARN L202 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2021-02-24 00:35:51,633 WARN L202 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-02-24 00:35:52,003 WARN L202 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 47 [2021-02-24 00:35:52,662 WARN L202 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2021-02-24 00:35:52,839 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-02-24 00:35:53,028 WARN L202 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-02-24 00:35:53,153 WARN L202 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-24 00:35:53,278 WARN L202 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-24 00:35:53,621 WARN L202 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-24 00:35:53,954 WARN L202 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2021-02-24 00:35:55,017 WARN L202 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2021-02-24 00:35:55,410 WARN L202 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2021-02-24 00:35:55,759 WARN L202 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2021-02-24 00:35:56,993 WARN L202 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 165 DAG size of output: 82 [2021-02-24 00:35:57,695 WARN L202 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2021-02-24 00:35:57,966 WARN L202 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2021-02-24 00:35:59,789 WARN L202 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2021-02-24 00:35:59,937 WARN L202 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 32 [2021-02-24 00:36:00,670 WARN L202 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-24 00:36:01,459 WARN L202 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2021-02-24 00:36:01,623 WARN L202 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2021-02-24 00:36:02,121 WARN L202 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 51 [2021-02-24 00:36:02,395 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-02-24 00:36:02,982 WARN L202 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2021-02-24 00:36:03,181 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-02-24 00:36:03,983 WARN L202 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-24 00:36:04,726 WARN L202 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-24 00:36:05,022 WARN L202 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2021-02-24 00:36:07,108 WARN L202 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 174 DAG size of output: 89 [2021-02-24 00:36:07,798 WARN L202 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2021-02-24 00:36:10,369 WARN L202 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 206 DAG size of output: 102 [2021-02-24 00:36:10,591 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-24 00:36:10,759 WARN L202 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-24 00:36:11,155 WARN L202 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2021-02-24 00:36:12,481 WARN L202 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 166 DAG size of output: 80 [2021-02-24 00:36:13,049 WARN L202 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 55 [2021-02-24 00:36:13,456 WARN L202 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2021-02-24 00:36:14,267 WARN L202 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2021-02-24 00:36:15,137 WARN L202 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2021-02-24 00:36:15,828 WARN L202 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2021-02-24 00:36:16,347 WARN L202 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2021-02-24 00:36:17,753 WARN L202 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-24 00:36:17,891 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2021-02-24 00:36:18,499 WARN L202 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2021-02-24 00:36:18,926 WARN L202 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2021-02-24 00:36:19,249 WARN L202 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2021-02-24 00:36:19,420 WARN L202 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-02-24 00:36:22,077 WARN L202 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 206 DAG size of output: 102 [2021-02-24 00:36:22,247 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-24 00:36:23,061 WARN L202 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2021-02-24 00:36:23,696 WARN L202 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2021-02-24 00:36:24,843 WARN L202 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2021-02-24 00:36:25,351 WARN L202 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-24 00:36:26,108 WARN L202 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-24 00:36:26,437 WARN L202 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2021-02-24 00:36:26,914 WARN L202 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-02-24 00:36:28,447 WARN L202 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-24 00:36:28,839 WARN L202 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2021-02-24 00:36:30,252 WARN L202 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-24 00:36:30,608 WARN L202 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-24 00:36:31,566 WARN L202 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-24 00:36:31,726 WARN L202 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2021-02-24 00:36:31,920 WARN L202 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-02-24 00:36:32,771 WARN L202 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2021-02-24 00:36:32,941 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-24 00:36:33,231 WARN L202 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-24 00:36:33,639 WARN L202 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2021-02-24 00:36:34,574 WARN L202 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2021-02-24 00:36:35,098 WARN L202 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2021-02-24 00:36:35,575 WARN L202 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-02-24 00:36:36,242 WARN L202 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2021-02-24 00:36:36,682 WARN L202 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-02-24 00:36:37,518 WARN L202 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2021-02-24 00:36:38,294 WARN L202 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2021-02-24 00:36:38,463 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-24 00:36:38,613 WARN L202 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-02-24 00:36:39,098 WARN L202 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2021-02-24 00:36:41,200 WARN L202 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2021-02-24 00:36:43,355 WARN L202 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 176 DAG size of output: 91 [2021-02-24 00:36:43,841 WARN L202 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-02-24 00:36:45,349 WARN L202 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-24 00:36:45,500 WARN L202 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-02-24 00:36:46,372 WARN L202 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2021-02-24 00:36:47,406 WARN L202 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-24 00:36:48,413 WARN L202 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-24 00:36:50,578 WARN L202 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2021-02-24 00:36:51,378 WARN L202 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2021-02-24 00:36:52,345 WARN L202 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-24 00:36:52,521 WARN L202 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2021-02-24 00:36:52,944 WARN L202 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2021-02-24 00:36:53,135 WARN L202 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-02-24 00:36:53,594 WARN L202 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-24 00:36:53,892 WARN L202 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2021-02-24 00:36:54,024 WARN L202 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-24 00:36:54,203 WARN L202 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2021-02-24 00:36:55,909 WARN L202 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 158 DAG size of output: 80 [2021-02-24 00:36:56,079 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-24 00:36:56,248 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-24 00:36:56,872 WARN L202 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2021-02-24 00:36:57,735 WARN L202 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 67 [2021-02-24 00:36:58,016 WARN L202 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2021-02-24 00:36:58,174 WARN L202 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2021-02-24 00:36:59,902 WARN L202 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2021-02-24 00:37:00,148 WARN L202 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2021-02-24 00:37:01,170 WARN L202 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2021-02-24 00:37:01,599 WARN L202 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 40 [2021-02-24 00:37:01,842 WARN L202 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2021-02-24 00:37:03,690 WARN L202 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 145 DAG size of output: 83 [2021-02-24 00:37:04,043 WARN L202 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2021-02-24 00:37:04,653 WARN L202 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 42 [2021-02-24 00:37:04,781 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2021-02-24 00:37:05,052 WARN L202 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2021-02-24 00:37:05,502 WARN L202 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-02-24 00:37:05,508 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-24 00:37:05,510 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-24 00:37:05,510 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-24 00:37:05,510 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-24 00:37:05,511 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-24 00:37:05,511 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-24 00:37:05,512 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-24 00:37:05,512 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-24 00:37:05,513 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-24 00:37:05,513 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-24 00:37:05,514 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-24 00:37:05,514 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-24 00:37:05,515 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-24 00:37:05,515 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-24 00:37:05,516 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-24 00:37:05,516 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-24 00:37:05,516 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-24 00:37:05,517 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-24 00:37:05,517 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-24 00:37:05,517 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-24 00:37:05,518 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-24 00:37:05,518 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-24 00:37:05,518 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-24 00:37:05,519 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-24 00:37:05,519 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-24 00:37:05,519 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-24 00:37:05,521 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-24 00:37:05,521 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-24 00:37:05,522 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-24 00:37:05,522 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-24 00:37:05,522 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-24 00:37:05,523 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-24 00:37:05,523 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-24 00:37:05,523 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-24 00:37:05,524 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-24 00:37:05,524 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-24 00:37:05,524 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-24 00:37:05,524 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-24 00:37:05,524 INFO L192 CegarLoopUtils]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2021-02-24 00:37:05,525 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-24 00:37:05,525 INFO L192 CegarLoopUtils]: At program point L180(lines 180 190) the Hoare annotation is: true [2021-02-24 00:37:05,525 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-24 00:37:05,525 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-24 00:37:05,525 INFO L192 CegarLoopUtils]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2021-02-24 00:37:05,525 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-24 00:37:05,525 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-24 00:37:05,526 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-24 00:37:05,526 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-24 00:37:05,526 INFO L192 CegarLoopUtils]: At program point L135(lines 135 144) the Hoare annotation is: true [2021-02-24 00:37:05,526 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-24 00:37:05,526 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-24 00:37:05,526 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-24 00:37:05,527 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-24 00:37:05,527 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-24 00:37:05,527 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-24 00:37:05,527 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-24 00:37:05,528 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-24 00:37:05,528 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-24 00:37:05,528 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-24 00:37:05,528 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-24 00:37:05,528 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-24 00:37:05,528 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-24 00:37:05,529 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-24 00:37:05,529 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-24 00:37:05,529 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-24 00:37:05,529 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-24 00:37:05,529 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-24 00:37:05,529 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-24 00:37:05,529 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-24 00:37:05,529 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 464 475) the Hoare annotation is: true [2021-02-24 00:37:05,529 INFO L192 CegarLoopUtils]: At program point L473(line 473) the Hoare annotation is: true [2021-02-24 00:37:05,529 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 464 475) the Hoare annotation is: true [2021-02-24 00:37:05,530 INFO L192 CegarLoopUtils]: At program point L470(line 470) the Hoare annotation is: true [2021-02-24 00:37:05,530 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-24 00:37:05,530 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-24 00:37:05,530 INFO L192 CegarLoopUtils]: At program point errorEXIT(lines 8 15) the Hoare annotation is: true [2021-02-24 00:37:05,530 INFO L192 CegarLoopUtils]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2021-02-24 00:37:05,530 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-24 00:37:05,530 INFO L192 CegarLoopUtils]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2021-02-24 00:37:05,530 INFO L192 CegarLoopUtils]: At program point errorFINAL(lines 8 15) the Hoare annotation is: true [2021-02-24 00:37:05,531 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-24 00:37:05,531 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-24 00:37:05,531 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-24 00:37:05,532 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-24 00:37:05,532 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-24 00:37:05,532 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-24 00:37:05,532 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-24 00:37:05,533 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-24 00:37:05,533 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-24 00:37:05,533 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-24 00:37:05,533 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-24 00:37:05,533 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-24 00:37:05,534 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-24 00:37:05,534 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-24 00:37:05,534 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-24 00:37:05,534 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-24 00:37:05,534 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-24 00:37:05,534 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,535 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,536 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,537 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-24 00:37:05,538 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-24 00:37:05,538 INFO L192 CegarLoopUtils]: At program point L392(line 392) the Hoare annotation is: true [2021-02-24 00:37:05,538 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-24 00:37:05,538 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-24 00:37:05,538 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-24 00:37:05,538 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-24 00:37:05,538 INFO L192 CegarLoopUtils]: At program point L388(line 388) the Hoare annotation is: true [2021-02-24 00:37:05,538 INFO L192 CegarLoopUtils]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2021-02-24 00:37:05,539 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-24 00:37:05,539 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-24 00:37:05,539 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-24 00:37:05,540 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-24 00:37:05,540 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-24 00:37:05,540 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-24 00:37:05,540 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-24 00:37:05,541 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-24 00:37:05,541 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-24 00:37:05,541 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-24 00:37:05,541 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-24 00:37:05,542 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-24 00:37:05,542 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-24 00:37:05,542 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-24 00:37:05,542 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-24 00:37:05,543 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-24 00:37:05,543 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-24 00:37:05,543 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-24 00:37:05,544 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-24 00:37:05,544 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-24 00:37:05,544 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-24 00:37:05,544 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-24 00:37:05,545 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-24 00:37:05,545 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-24 00:37:05,545 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-24 00:37:05,545 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-24 00:37:05,545 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-24 00:37:05,546 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-24 00:37:05,546 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-24 00:37:05,546 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-24 00:37:05,546 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-24 00:37:05,546 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-24 00:37:05,546 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-24 00:37:05,547 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-24 00:37:05,547 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-24 00:37:05,547 INFO L192 CegarLoopUtils]: At program point update_channelsEXIT(lines 150 157) the Hoare annotation is: true [2021-02-24 00:37:05,547 INFO L192 CegarLoopUtils]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2021-02-24 00:37:05,547 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-24 00:37:05,547 INFO L192 CegarLoopUtils]: At program point start_simulationEXIT(lines 405 463) the Hoare annotation is: true [2021-02-24 00:37:05,547 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-24 00:37:05,547 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-24 00:37:05,548 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-24 00:37:05,548 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-24 00:37:05,548 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-24 00:37:05,548 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-24 00:37:05,548 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-24 00:37:05,548 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-24 00:37:05,548 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-24 00:37:05,549 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-24 00:37:05,549 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-24 00:37:05,549 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-24 00:37:05,549 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-24 00:37:05,549 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-24 00:37:05,549 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-24 00:37:05,550 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-24 00:37:05,550 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-24 00:37:05,550 INFO L192 CegarLoopUtils]: At program point L458(lines 405 463) the Hoare annotation is: true [2021-02-24 00:37:05,550 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-24 00:37:05,550 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-24 00:37:05,550 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-24 00:37:05,550 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-24 00:37:05,551 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-24 00:37:05,551 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-24 00:37:05,551 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-24 00:37:05,551 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-24 00:37:05,551 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-24 00:37:05,551 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-24 00:37:05,551 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-24 00:37:05,552 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-24 00:37:05,552 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-24 00:37:05,552 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-24 00:37:05,552 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-24 00:37:05,552 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-24 00:37:05,553 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-24 00:37:05,553 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-24 00:37:05,553 INFO L192 CegarLoopUtils]: At program point L116(lines 116 125) the Hoare annotation is: true [2021-02-24 00:37:05,553 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-24 00:37:05,553 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-24 00:37:05,553 INFO L192 CegarLoopUtils]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2021-02-24 00:37:05,553 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-24 00:37:05,554 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-24 00:37:05,554 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-24 00:37:05,554 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-24 00:37:05,554 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-24 00:37:05,554 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-24 00:37:05,554 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-24 00:37:05,554 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-24 00:37:05,555 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-24 00:37:05,555 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-24 00:37:05,555 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-24 00:37:05,555 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-24 00:37:05,555 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-24 00:37:05,556 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-24 00:37:05,556 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-24 00:37:05,556 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-24 00:37:05,556 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-24 00:37:05,556 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-24 00:37:05,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:37:05 BoogieIcfgContainer [2021-02-24 00:37:05,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 00:37:05,640 INFO L168 Benchmark]: Toolchain (without parser) took 275745.28 ms. Allocated memory was 159.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 135.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 8.0 GB. [2021-02-24 00:37:05,640 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 159.4 MB. Free memory is still 133.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 00:37:05,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.70 ms. Allocated memory is still 159.4 MB. Free memory was 134.3 MB in the beginning and 121.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-02-24 00:37:05,640 INFO L168 Benchmark]: Boogie Preprocessor took 68.30 ms. Allocated memory is still 159.4 MB. Free memory was 121.7 MB in the beginning and 119.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 00:37:05,641 INFO L168 Benchmark]: RCFGBuilder took 1133.37 ms. Allocated memory is still 159.4 MB. Free memory was 119.7 MB in the beginning and 110.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-24 00:37:05,641 INFO L168 Benchmark]: TraceAbstraction took 274055.08 ms. Allocated memory was 159.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 110.6 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 8.0 GB. [2021-02-24 00:37:05,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 159.4 MB. Free memory is still 133.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 464.70 ms. Allocated memory is still 159.4 MB. Free memory was 134.3 MB in the beginning and 121.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.30 ms. Allocated memory is still 159.4 MB. Free memory was 121.7 MB in the beginning and 119.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1133.37 ms. Allocated memory is still 159.4 MB. Free memory was 119.7 MB in the beginning and 110.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 274055.08 ms. Allocated memory was 159.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 110.6 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. 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: 115.8s, OverallIterations: 16, TraceHistogramMax: 8, AutomataDifference: 92.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 157.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4509 SDtfs, 27749 SDslu, 2679 SDs, 0 SdLazy, 30647 SolverSat, 9592 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1782 GetRequests, 1113 SyntacticMatches, 2 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11282 ImplicationChecksByTransitivity, 23.1s 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: 12.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 9639 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 227 LocationsWithAnnotation, 42830 PreInvPairs, 45381 NumberOfFragments, 33304 HoareAnnotationTreeSize, 42830 FomulaSimplifications, 7363179199 FormulaSimplificationTreeSizeReduction, 38.5s HoareSimplificationTime, 227 FomulaSimplificationsInter, 3403011 FormulaSimplificationTreeSizeReductionInter, 118.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 4632 NumberOfCodeBlocks, 4632 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4616 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 3701/3844 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...