/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:51:28,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:51:28,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:51:28,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:51:28,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:51:28,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:51:28,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:51:28,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:51:28,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:51:28,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:51:28,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:51:28,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:51:28,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:51:28,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:51:28,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:51:28,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:51:28,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:51:28,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:51:28,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:51:28,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:51:28,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:51:28,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:51:28,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:51:28,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:51:28,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:51:28,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:51:28,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:51:28,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:51:28,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:51:28,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:51:28,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:51:28,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:51:28,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:51:28,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:51:28,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:51:28,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:51:28,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:51:28,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:51:28,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:51:28,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:51:28,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:51:28,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:51:28,248 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:51:28,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:51:28,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:51:28,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:51:28,253 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:51:28,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:51:28,253 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:51:28,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:51:28,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:51:28,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:51:28,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:51:28,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:51:28,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:51:28,256 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:51:28,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:51:28,256 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:51:28,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:51:28,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:51:28,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:51:28,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:51:28,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:51:28,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:51:28,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:51:28,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:51:28,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:51:28,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:51:28,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:51:28,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:51:28,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:51:28,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:51:28,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:51:28,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:51:28,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:51:28,668 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:51:28,668 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:51:28,669 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 [2020-11-06 22:51:28,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be92a8265/09e945ed425d4de8bcfc699c1c918674/FLAG38250c858 [2020-11-06 22:51:29,424 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:51:29,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-11-06 22:51:29,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be92a8265/09e945ed425d4de8bcfc699c1c918674/FLAG38250c858 [2020-11-06 22:51:29,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be92a8265/09e945ed425d4de8bcfc699c1c918674 [2020-11-06 22:51:29,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:51:29,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:51:29,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:51:29,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:51:29,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:51:29,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:29" (1/1) ... [2020-11-06 22:51:29,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7e8252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29, skipping insertion in model container [2020-11-06 22:51:29,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:29" (1/1) ... [2020-11-06 22:51:29,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:51:29,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:51:30,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:51:30,051 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:51:30,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:51:30,114 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:51:30,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30 WrapperNode [2020-11-06 22:51:30,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:51:30,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:51:30,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:51:30,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:51:30,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (1/1) ... [2020-11-06 22:51:30,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:51:30,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:51:30,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:51:30,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:51:30,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51: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 [2020-11-06 22:51:30,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:51:30,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:51:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:51:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-06 22:51:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-06 22:51:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-06 22:51:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-06 22:51:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-06 22:51:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-06 22:51:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-06 22:51:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-06 22:51:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-06 22:51:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-06 22:51:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-06 22:51:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-06 22:51:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-06 22:51:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-06 22:51:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-06 22:51:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-06 22:51:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-06 22:51:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-06 22:51:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:51:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:51:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:51:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:51:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:51:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-06 22:51:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-06 22:51:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-06 22:51:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-06 22:51:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:51:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-06 22:51:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-06 22:51:30,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:51:30,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:51:30,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:51:30,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:51:30,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:51:30,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:51:30,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:51:30,872 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:51:30,872 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-06 22:51:30,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:30 BoogieIcfgContainer [2020-11-06 22:51:30,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:51:30,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:51:30,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:51:30,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:51:30,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:29" (1/3) ... [2020-11-06 22:51:30,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597ed35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:30, skipping insertion in model container [2020-11-06 22:51:30,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30" (2/3) ... [2020-11-06 22:51:30,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597ed35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:30, skipping insertion in model container [2020-11-06 22:51:30,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:30" (3/3) ... [2020-11-06 22:51:30,883 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-11-06 22:51:30,898 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:51:30,902 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:51:30,914 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:51:30,942 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:51:30,942 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:51:30,942 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:51:30,942 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:51:30,942 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:51:30,942 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:51:30,943 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:51:30,943 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:51:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-11-06 22:51:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:30,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:30,976 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] [2020-11-06 22:51:30,976 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1369809545, now seen corresponding path program 1 times [2020-11-06 22:51:30,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:30,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538693354] [2020-11-06 22:51:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:31,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538693354] [2020-11-06 22:51:31,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:31,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:51:31,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495653421] [2020-11-06 22:51:31,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:51:31,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:31,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:51:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:51:31,612 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 8 states. [2020-11-06 22:51:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:33,844 INFO L93 Difference]: Finished difference Result 512 states and 770 transitions. [2020-11-06 22:51:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:51:33,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-11-06 22:51:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:33,864 INFO L225 Difference]: With dead ends: 512 [2020-11-06 22:51:33,865 INFO L226 Difference]: Without dead ends: 364 [2020-11-06 22:51:33,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:51:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-06 22:51:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 245. [2020-11-06 22:51:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-11-06 22:51:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 325 transitions. [2020-11-06 22:51:33,982 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 325 transitions. Word has length 78 [2020-11-06 22:51:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:33,983 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 325 transitions. [2020-11-06 22:51:33,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:51:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 325 transitions. [2020-11-06 22:51:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:33,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:33,989 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] [2020-11-06 22:51:33,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:51:33,989 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash -618365385, now seen corresponding path program 1 times [2020-11-06 22:51:33,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:33,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063045107] [2020-11-06 22:51:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:34,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063045107] [2020-11-06 22:51:34,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:34,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:51:34,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786052572] [2020-11-06 22:51:34,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:51:34,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:34,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:51:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:51:34,334 INFO L87 Difference]: Start difference. First operand 245 states and 325 transitions. Second operand 9 states. [2020-11-06 22:51:34,670 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-11-06 22:51:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:37,661 INFO L93 Difference]: Finished difference Result 921 states and 1299 transitions. [2020-11-06 22:51:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:51:37,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-06 22:51:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:37,674 INFO L225 Difference]: With dead ends: 921 [2020-11-06 22:51:37,675 INFO L226 Difference]: Without dead ends: 695 [2020-11-06 22:51:37,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:51:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-11-06 22:51:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 464. [2020-11-06 22:51:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-06 22:51:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 621 transitions. [2020-11-06 22:51:37,791 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 621 transitions. Word has length 78 [2020-11-06 22:51:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:37,792 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 621 transitions. [2020-11-06 22:51:37,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:51:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 621 transitions. [2020-11-06 22:51:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:37,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:37,796 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] [2020-11-06 22:51:37,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:51:37,797 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:37,797 INFO L82 PathProgramCache]: Analyzing trace with hash -577690635, now seen corresponding path program 1 times [2020-11-06 22:51:37,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:37,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526121134] [2020-11-06 22:51:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:37,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:37,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:37,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:38,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526121134] [2020-11-06 22:51:38,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:38,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:38,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893857871] [2020-11-06 22:51:38,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:38,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:38,086 INFO L87 Difference]: Start difference. First operand 464 states and 621 transitions. Second operand 10 states. [2020-11-06 22:51:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:39,942 INFO L93 Difference]: Finished difference Result 1287 states and 1858 transitions. [2020-11-06 22:51:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:51:39,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-06 22:51:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:39,951 INFO L225 Difference]: With dead ends: 1287 [2020-11-06 22:51:39,952 INFO L226 Difference]: Without dead ends: 843 [2020-11-06 22:51:39,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:51:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-11-06 22:51:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 566. [2020-11-06 22:51:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-11-06 22:51:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 726 transitions. [2020-11-06 22:51:40,069 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 726 transitions. Word has length 78 [2020-11-06 22:51:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:40,071 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 726 transitions. [2020-11-06 22:51:40,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 726 transitions. [2020-11-06 22:51:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:40,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:40,081 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] [2020-11-06 22:51:40,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:51:40,081 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 871134389, now seen corresponding path program 1 times [2020-11-06 22:51:40,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:40,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828271680] [2020-11-06 22:51:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:40,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828271680] [2020-11-06 22:51:40,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:40,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:51:40,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824197422] [2020-11-06 22:51:40,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:51:40,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:51:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:51:40,374 INFO L87 Difference]: Start difference. First operand 566 states and 726 transitions. Second operand 9 states. [2020-11-06 22:51:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:43,051 INFO L93 Difference]: Finished difference Result 1829 states and 2441 transitions. [2020-11-06 22:51:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:51:43,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-06 22:51:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:43,077 INFO L225 Difference]: With dead ends: 1829 [2020-11-06 22:51:43,077 INFO L226 Difference]: Without dead ends: 1420 [2020-11-06 22:51:43,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:51:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-11-06 22:51:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1039. [2020-11-06 22:51:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2020-11-06 22:51:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1349 transitions. [2020-11-06 22:51:43,224 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1349 transitions. Word has length 78 [2020-11-06 22:51:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:43,225 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1349 transitions. [2020-11-06 22:51:43,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:51:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1349 transitions. [2020-11-06 22:51:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:43,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:43,227 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] [2020-11-06 22:51:43,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:51:43,227 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:43,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1747153395, now seen corresponding path program 1 times [2020-11-06 22:51:43,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:43,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389604691] [2020-11-06 22:51:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:43,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389604691] [2020-11-06 22:51:43,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:43,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:43,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721806445] [2020-11-06 22:51:43,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:43,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:43,460 INFO L87 Difference]: Start difference. First operand 1039 states and 1349 transitions. Second operand 10 states. [2020-11-06 22:51:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:45,057 INFO L93 Difference]: Finished difference Result 2346 states and 3129 transitions. [2020-11-06 22:51:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:51:45,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-06 22:51:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:45,066 INFO L225 Difference]: With dead ends: 2346 [2020-11-06 22:51:45,066 INFO L226 Difference]: Without dead ends: 1327 [2020-11-06 22:51:45,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:51:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2020-11-06 22:51:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1084. [2020-11-06 22:51:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2020-11-06 22:51:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1387 transitions. [2020-11-06 22:51:45,201 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1387 transitions. Word has length 78 [2020-11-06 22:51:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:45,201 INFO L481 AbstractCegarLoop]: Abstraction has 1084 states and 1387 transitions. [2020-11-06 22:51:45,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1387 transitions. [2020-11-06 22:51:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:45,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:45,203 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] [2020-11-06 22:51:45,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:51:45,204 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2124167179, now seen corresponding path program 1 times [2020-11-06 22:51:45,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:45,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992016194] [2020-11-06 22:51:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:45,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992016194] [2020-11-06 22:51:45,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:45,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:45,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070517264] [2020-11-06 22:51:45,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:45,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:45,445 INFO L87 Difference]: Start difference. First operand 1084 states and 1387 transitions. Second operand 10 states. [2020-11-06 22:51:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:46,999 INFO L93 Difference]: Finished difference Result 2471 states and 3251 transitions. [2020-11-06 22:51:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:51:46,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-06 22:51:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:47,008 INFO L225 Difference]: With dead ends: 2471 [2020-11-06 22:51:47,008 INFO L226 Difference]: Without dead ends: 1407 [2020-11-06 22:51:47,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:51:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-11-06 22:51:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1154. [2020-11-06 22:51:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2020-11-06 22:51:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1455 transitions. [2020-11-06 22:51:47,135 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1455 transitions. Word has length 78 [2020-11-06 22:51:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:47,135 INFO L481 AbstractCegarLoop]: Abstraction has 1154 states and 1455 transitions. [2020-11-06 22:51:47,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1455 transitions. [2020-11-06 22:51:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:47,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:47,137 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] [2020-11-06 22:51:47,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:51:47,138 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1849407565, now seen corresponding path program 1 times [2020-11-06 22:51:47,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:47,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979087096] [2020-11-06 22:51:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:47,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979087096] [2020-11-06 22:51:47,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:47,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:47,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280685129] [2020-11-06 22:51:47,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:47,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:47,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:47,335 INFO L87 Difference]: Start difference. First operand 1154 states and 1455 transitions. Second operand 10 states. [2020-11-06 22:51:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:49,829 INFO L93 Difference]: Finished difference Result 2482 states and 3209 transitions. [2020-11-06 22:51:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-06 22:51:49,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-06 22:51:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:49,838 INFO L225 Difference]: With dead ends: 2482 [2020-11-06 22:51:49,838 INFO L226 Difference]: Without dead ends: 1349 [2020-11-06 22:51:49,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:51:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-11-06 22:51:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1002. [2020-11-06 22:51:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2020-11-06 22:51:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1225 transitions. [2020-11-06 22:51:49,970 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1225 transitions. Word has length 78 [2020-11-06 22:51:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:49,971 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 1225 transitions. [2020-11-06 22:51:49,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1225 transitions. [2020-11-06 22:51:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-06 22:51:49,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:49,972 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] [2020-11-06 22:51:49,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:51:49,973 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1708858955, now seen corresponding path program 1 times [2020-11-06 22:51:49,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:49,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443735373] [2020-11-06 22:51:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:50,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443735373] [2020-11-06 22:51:50,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:50,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:51:50,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596614955] [2020-11-06 22:51:50,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:51:50,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:51:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:51:50,140 INFO L87 Difference]: Start difference. First operand 1002 states and 1225 transitions. Second operand 7 states. [2020-11-06 22:51:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:51,807 INFO L93 Difference]: Finished difference Result 2869 states and 3761 transitions. [2020-11-06 22:51:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:51:51,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-11-06 22:51:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:51,819 INFO L225 Difference]: With dead ends: 2869 [2020-11-06 22:51:51,819 INFO L226 Difference]: Without dead ends: 1899 [2020-11-06 22:51:51,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:51:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2020-11-06 22:51:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1571. [2020-11-06 22:51:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-11-06 22:51:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1980 transitions. [2020-11-06 22:51:51,995 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1980 transitions. Word has length 78 [2020-11-06 22:51:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:51,996 INFO L481 AbstractCegarLoop]: Abstraction has 1571 states and 1980 transitions. [2020-11-06 22:51:51,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:51:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1980 transitions. [2020-11-06 22:51:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-11-06 22:51:51,999 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:51,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:51:51,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:51:52,000 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1805037588, now seen corresponding path program 1 times [2020-11-06 22:51:52,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:52,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136591474] [2020-11-06 22:51:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:51:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:51:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:51:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-06 22:51:52,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136591474] [2020-11-06 22:51:52,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:52,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:52,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748907228] [2020-11-06 22:51:52,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:52,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:52,310 INFO L87 Difference]: Start difference. First operand 1571 states and 1980 transitions. Second operand 10 states. [2020-11-06 22:51:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:54,902 INFO L93 Difference]: Finished difference Result 4959 states and 6930 transitions. [2020-11-06 22:51:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:51:54,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2020-11-06 22:51:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:54,929 INFO L225 Difference]: With dead ends: 4959 [2020-11-06 22:51:54,930 INFO L226 Difference]: Without dead ends: 3444 [2020-11-06 22:51:54,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:51:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2020-11-06 22:51:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 2789. [2020-11-06 22:51:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2020-11-06 22:51:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3693 transitions. [2020-11-06 22:51:55,263 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3693 transitions. Word has length 122 [2020-11-06 22:51:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:55,264 INFO L481 AbstractCegarLoop]: Abstraction has 2789 states and 3693 transitions. [2020-11-06 22:51:55,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3693 transitions. [2020-11-06 22:51:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-11-06 22:51:55,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:55,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:51:55,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:51:55,273 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1923479062, now seen corresponding path program 1 times [2020-11-06 22:51:55,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:55,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061102165] [2020-11-06 22:51:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:51:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:51:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:51:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-06 22:51:55,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061102165] [2020-11-06 22:51:55,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:55,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:51:55,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382703035] [2020-11-06 22:51:55,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:51:55,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:51:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:51:55,532 INFO L87 Difference]: Start difference. First operand 2789 states and 3693 transitions. Second operand 9 states. [2020-11-06 22:51:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:56,972 INFO L93 Difference]: Finished difference Result 5950 states and 7955 transitions. [2020-11-06 22:51:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:51:56,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2020-11-06 22:51:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:56,993 INFO L225 Difference]: With dead ends: 5950 [2020-11-06 22:51:56,993 INFO L226 Difference]: Without dead ends: 3216 [2020-11-06 22:51:57,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:51:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2020-11-06 22:51:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2749. [2020-11-06 22:51:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2020-11-06 22:51:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3645 transitions. [2020-11-06 22:51:57,300 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3645 transitions. Word has length 122 [2020-11-06 22:51:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:57,300 INFO L481 AbstractCegarLoop]: Abstraction has 2749 states and 3645 transitions. [2020-11-06 22:51:57,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:51:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3645 transitions. [2020-11-06 22:51:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-11-06 22:51:57,304 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:57,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:51:57,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:51:57,305 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1083119423, now seen corresponding path program 1 times [2020-11-06 22:51:57,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:57,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723698633] [2020-11-06 22:51:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:51:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:51:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:51:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:51:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:51:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:51:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:51:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-06 22:51:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:51:57,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723698633] [2020-11-06 22:51:57,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:57,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:51:57,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381276841] [2020-11-06 22:51:57,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:51:57,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:57,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:51:57,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:51:57,593 INFO L87 Difference]: Start difference. First operand 2749 states and 3645 transitions. Second operand 11 states. [2020-11-06 22:52:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:52:02,350 INFO L93 Difference]: Finished difference Result 8959 states and 12424 transitions. [2020-11-06 22:52:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:52:02,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-11-06 22:52:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:52:02,378 INFO L225 Difference]: With dead ends: 8959 [2020-11-06 22:52:02,378 INFO L226 Difference]: Without dead ends: 4565 [2020-11-06 22:52:02,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2020-11-06 22:52:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2020-11-06 22:52:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 3982. [2020-11-06 22:52:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2020-11-06 22:52:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5087 transitions. [2020-11-06 22:52:02,765 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5087 transitions. Word has length 123 [2020-11-06 22:52:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:52:02,765 INFO L481 AbstractCegarLoop]: Abstraction has 3982 states and 5087 transitions. [2020-11-06 22:52:02,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:52:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5087 transitions. [2020-11-06 22:52:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-11-06 22:52:02,770 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:52:02,770 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:52:02,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:52:02,771 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:52:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:52:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash 575771240, now seen corresponding path program 1 times [2020-11-06 22:52:02,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:52:02,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618173567] [2020-11-06 22:52:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:52:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:52:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:52:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:52:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:52:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:52:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:52:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:52:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:52:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:02,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:52:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:03,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:03,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:03,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:03,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-11-06 22:52:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-06 22:52:03,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618173567] [2020-11-06 22:52:03,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:52:03,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:52:03,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090106262] [2020-11-06 22:52:03,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:52:03,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:52:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:52:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:52:03,061 INFO L87 Difference]: Start difference. First operand 3982 states and 5087 transitions. Second operand 10 states. [2020-11-06 22:52:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:52:05,460 INFO L93 Difference]: Finished difference Result 9188 states and 12374 transitions. [2020-11-06 22:52:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:52:05,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2020-11-06 22:52:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:52:05,493 INFO L225 Difference]: With dead ends: 9188 [2020-11-06 22:52:05,493 INFO L226 Difference]: Without dead ends: 5253 [2020-11-06 22:52:05,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:52:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2020-11-06 22:52:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4770. [2020-11-06 22:52:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2020-11-06 22:52:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 5960 transitions. [2020-11-06 22:52:06,038 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 5960 transitions. Word has length 157 [2020-11-06 22:52:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:52:06,039 INFO L481 AbstractCegarLoop]: Abstraction has 4770 states and 5960 transitions. [2020-11-06 22:52:06,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:52:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 5960 transitions. [2020-11-06 22:52:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-06 22:52:06,047 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:52:06,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:52:06,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:52:06,047 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:52:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:52:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash 220073049, now seen corresponding path program 1 times [2020-11-06 22:52:06,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:52:06,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934171915] [2020-11-06 22:52:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:52:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:52:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:52:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:52:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:52:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:52:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:52:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:52:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:52:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:52:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:52:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-06 22:52:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-06 22:52:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-06 22:52:06,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934171915] [2020-11-06 22:52:06,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514652807] [2020-11-06 22:52:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:52:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:06,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:52:06,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:52:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-06 22:52:06,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:52:06,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2020-11-06 22:52:06,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369952671] [2020-11-06 22:52:06,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:52:06,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:52:06,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:52:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:52:06,604 INFO L87 Difference]: Start difference. First operand 4770 states and 5960 transitions. Second operand 3 states. [2020-11-06 22:52:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:52:07,052 INFO L93 Difference]: Finished difference Result 8445 states and 11070 transitions. [2020-11-06 22:52:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:52:07,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-11-06 22:52:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:52:07,074 INFO L225 Difference]: With dead ends: 8445 [2020-11-06 22:52:07,074 INFO L226 Difference]: Without dead ends: 4594 [2020-11-06 22:52:07,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:52:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2020-11-06 22:52:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4588. [2020-11-06 22:52:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4588 states. [2020-11-06 22:52:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 5615 transitions. [2020-11-06 22:52:07,587 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 5615 transitions. Word has length 176 [2020-11-06 22:52:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:52:07,587 INFO L481 AbstractCegarLoop]: Abstraction has 4588 states and 5615 transitions. [2020-11-06 22:52:07,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:52:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 5615 transitions. [2020-11-06 22:52:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-06 22:52:07,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:52:07,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:52:07,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-06 22:52:07,808 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:52:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:52:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1184187008, now seen corresponding path program 1 times [2020-11-06 22:52:07,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:52:07,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530433096] [2020-11-06 22:52:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:52:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:52:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:52:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:52:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:52:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:52:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:52:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:52:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:52:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:07,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:52:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:52:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-06 22:52:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-11-06 22:52:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-11-06 22:52:08,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530433096] [2020-11-06 22:52:08,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927302923] [2020-11-06 22:52:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:52:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:08,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:52:08,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:52:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-06 22:52:08,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:52:08,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 12 [2020-11-06 22:52:08,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035620137] [2020-11-06 22:52:08,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:52:08,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:52:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:52:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:52:08,373 INFO L87 Difference]: Start difference. First operand 4588 states and 5615 transitions. Second operand 3 states. [2020-11-06 22:52:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:52:08,730 INFO L93 Difference]: Finished difference Result 6450 states and 7957 transitions. [2020-11-06 22:52:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:52:08,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-11-06 22:52:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:52:08,750 INFO L225 Difference]: With dead ends: 6450 [2020-11-06 22:52:08,750 INFO L226 Difference]: Without dead ends: 1843 [2020-11-06 22:52:08,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:52:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2020-11-06 22:52:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1833. [2020-11-06 22:52:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2020-11-06 22:52:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2094 transitions. [2020-11-06 22:52:08,977 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2094 transitions. Word has length 177 [2020-11-06 22:52:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:52:08,977 INFO L481 AbstractCegarLoop]: Abstraction has 1833 states and 2094 transitions. [2020-11-06 22:52:08,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:52:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2094 transitions. [2020-11-06 22:52:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-06 22:52:08,981 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:52:08,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:52:09,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-06 22:52:09,196 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:52:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:52:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash -655984418, now seen corresponding path program 1 times [2020-11-06 22:52:09,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:52:09,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394421742] [2020-11-06 22:52:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:52:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:52:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:52:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:52:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:52:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:52:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:52:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:52:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:52:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-06 22:52:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:52:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-06 22:52:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:52:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:52:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:52:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:52:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-11-06 22:52:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-11-06 22:52:09,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394421742] [2020-11-06 22:52:09,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912998266] [2020-11-06 22:52:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:52:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:52:09,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-06 22:52:09,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:52:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-06 22:52:09,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:52:09,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-11-06 22:52:09,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113853606] [2020-11-06 22:52:09,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:52:09,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:52:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:52:09,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:52:09,837 INFO L87 Difference]: Start difference. First operand 1833 states and 2094 transitions. Second operand 12 states. [2020-11-06 22:52:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:52:12,458 INFO L93 Difference]: Finished difference Result 2140 states and 2449 transitions. [2020-11-06 22:52:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:52:12,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2020-11-06 22:52:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:52:12,460 INFO L225 Difference]: With dead ends: 2140 [2020-11-06 22:52:12,460 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:52:12,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:52:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:52:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:52:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:52:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:52:12,474 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2020-11-06 22:52:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:52:12,474 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:52:12,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:52:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:52:12,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:52:12,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-06 22:52:12,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:52:13,241 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 46 [2020-11-06 22:52:13,465 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2020-11-06 22:52:13,602 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 37 [2020-11-06 22:52:13,786 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2020-11-06 22:52:14,249 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2020-11-06 22:52:14,674 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2020-11-06 22:52:14,859 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 114 [2020-11-06 22:52:15,263 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-11-06 22:52:15,705 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 119 [2020-11-06 22:52:15,870 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2020-11-06 22:52:16,306 WARN L194 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2020-11-06 22:52:16,531 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2020-11-06 22:52:16,725 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2020-11-06 22:52:17,130 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2020-11-06 22:52:17,354 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-11-06 22:52:17,584 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-11-06 22:52:17,811 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2020-11-06 22:52:17,929 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 125 [2020-11-06 22:52:18,060 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2020-11-06 22:52:18,581 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-11-06 22:52:18,849 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2020-11-06 22:52:19,238 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-11-06 22:52:20,974 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-11-06 22:52:21,174 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 113 [2020-11-06 22:52:21,479 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 131 [2020-11-06 22:52:22,446 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-11-06 22:52:24,709 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2020-11-06 22:52:25,667 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 119 [2020-11-06 22:52:25,781 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2020-11-06 22:52:26,010 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2020-11-06 22:52:26,258 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2020-11-06 22:52:26,745 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-11-06 22:52:26,955 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2020-11-06 22:52:27,124 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2020-11-06 22:52:27,348 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 132 [2020-11-06 22:52:27,808 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-11-06 22:52:27,966 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2020-11-06 22:52:28,306 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2020-11-06 22:52:30,836 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 119 [2020-11-06 22:52:31,146 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2020-11-06 22:52:32,047 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-11-06 22:52:32,222 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2020-11-06 22:52:32,431 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2020-11-06 22:52:33,019 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2020-11-06 22:52:33,349 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-11-06 22:52:36,792 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 83 [2020-11-06 22:52:39,636 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 1 [2020-11-06 22:52:39,942 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:52:44,496 WARN L194 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 481 DAG size of output: 92 [2020-11-06 22:52:44,856 WARN L194 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 44 [2020-11-06 22:52:45,480 WARN L194 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 62 [2020-11-06 22:52:45,694 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2020-11-06 22:52:47,327 WARN L194 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 303 DAG size of output: 75 [2020-11-06 22:52:48,691 WARN L194 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 214 DAG size of output: 60 [2020-11-06 22:52:49,035 WARN L194 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:52:49,588 WARN L194 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2020-11-06 22:52:50,126 WARN L194 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2020-11-06 22:52:51,495 WARN L194 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 214 DAG size of output: 60 [2020-11-06 22:52:51,615 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2020-11-06 22:52:56,841 WARN L194 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 489 DAG size of output: 92 [2020-11-06 22:52:57,791 WARN L194 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2020-11-06 22:52:58,004 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-11-06 22:52:58,281 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2020-11-06 22:52:58,424 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2020-11-06 22:52:58,603 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-11-06 22:53:00,404 WARN L194 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 213 DAG size of output: 53 [2020-11-06 22:53:00,712 WARN L194 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:01,017 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:01,412 WARN L194 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:01,553 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2020-11-06 22:53:01,697 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2020-11-06 22:53:01,928 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2020-11-06 22:53:02,232 WARN L194 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:02,537 WARN L194 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:03,497 WARN L194 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-11-06 22:53:03,800 WARN L194 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:08,408 WARN L194 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 481 DAG size of output: 92 [2020-11-06 22:53:08,990 WARN L194 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2020-11-06 22:53:11,371 WARN L194 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 264 DAG size of output: 65 [2020-11-06 22:53:11,511 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2020-11-06 22:53:11,773 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2020-11-06 22:53:13,085 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 182 DAG size of output: 75 [2020-11-06 22:53:13,550 WARN L194 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 50 [2020-11-06 22:53:14,357 WARN L194 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-11-06 22:53:15,010 WARN L194 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-11-06 22:53:15,423 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:15,544 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2020-11-06 22:53:15,857 WARN L194 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-06 22:53:17,128 WARN L194 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 218 DAG size of output: 75 [2020-11-06 22:53:17,869 WARN L194 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 54 [2020-11-06 22:53:18,272 WARN L194 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 55 [2020-11-06 22:53:18,454 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-11-06 22:53:19,808 WARN L194 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 162 DAG size of output: 76 [2020-11-06 22:53:20,356 WARN L194 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 46 [2020-11-06 22:53:21,445 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 225 DAG size of output: 56 [2020-11-06 22:53:21,972 WARN L194 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 54 [2020-11-06 22:53:21,979 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:53:21,980 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:53:21,980 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:53:21,980 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:53:21,980 INFO L262 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse18 (= ~m_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse11 (not .cse18)) (.cse14 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1))) (let ((.cse4 (= ~m_st~0 0)) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse20 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (= |old(~token~0)| ~token~0)) (.cse7 (= |old(~t1_pc~0)| 1)) (.cse8 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not .cse3)) (.cse19 (and .cse6 (or (and .cse17 .cse11 .cse15 .cse14) (and .cse16 .cse11 .cse14)))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0)))) (and (let ((.cse0 (or (and .cse14 .cse15) (and .cse16 .cse14))) (.cse1 (= ~t1_pc~0 1))) (or (let ((.cse2 (+ |old(~token~0)| 1))) (and .cse0 .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2) .cse3 .cse4)) .cse5 (and .cse6 .cse0 .cse1 .cse3) (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or (not (= ~M_E~0 2)) .cse8 .cse10 (and .cse17 .cse15) .cse18 (not (= ~E_1~0 ~M_E~0)) .cse12) (or .cse8 .cse10 .cse18 .cse19 .cse12) (or (and .cse4 .cse20 .cse15 .cse21 .cse22) .cse5 (not (= |old(~m_st~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse18 .cse13) (or (and .cse17 .cse20 .cse15 .cse21 .cse22) .cse7 .cse8 .cse10 .cse19 .cse12 .cse13))))) [2020-11-06 22:53:21,980 INFO L266 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-11-06 22:53:21,981 INFO L262 CegarLoopResult]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse7 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= |old(~token~0)| ~token~0))) (let ((.cse1 (= |old(~t1_pc~0)| 1)) (.cse6 (not (<= |old(~token~0)| ~local~0))) (.cse11 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (<= 2 ~E_1~0))) (.cse0 (and (= ~m_st~0 |old(~m_st~0)|) .cse7 .cse8 .cse9 .cse10)) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (= ~m_st~0 0) .cse7 .cse8 .cse9 .cse10) (not (= |old(~m_st~0)| 0)) .cse1 .cse2 .cse11 .cse3 .cse12 .cse5) (or .cse6 .cse0 .cse2 .cse11 .cse3 .cse4 .cse5) (or .cse0 .cse2 .cse3 .cse12 .cse4)))) [2020-11-06 22:53:21,981 INFO L266 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-11-06 22:53:21,981 INFO L262 CegarLoopResult]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse1 (= |old(~t1_pc~0)| 1)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (<= 2 ~E_1~0))) (.cse8 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not (= |old(~m_st~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse7 .cse6) (or .cse0 .cse8 .cse2 .cse3 .cse4 .cse7 .cse6) (or .cse8 .cse2 .cse4 .cse5 .cse7))) [2020-11-06 22:53:21,981 INFO L266 CegarLoopResult]: For program point transmit1EXIT(lines 76 111) no Hoare annotation was computed. [2020-11-06 22:53:21,981 INFO L262 CegarLoopResult]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse10 (<= 2 ~m_st~0)) (.cse13 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_M~0))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= ~m_st~0 0)) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse0 (and .cse10 (not .cse13) .cse6)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (let ((.cse4 (+ |old(~token~0)| 1))) (and .cse2 .cse3 (<= .cse4 ~token~0) (<= ~token~0 .cse4) .cse5 .cse6)) .cse7 .cse8 .cse9 (and .cse2 .cse10 .cse3 .cse6) .cse11 .cse12) (or .cse0 .cse7 .cse9 .cse13 .cse11) (or .cse1 (not (= |old(~m_st~0)| 0)) (and .cse2 .cse3 .cse5 .cse14 (= |old(~token~0)| ~token~0)) .cse15 .cse7 .cse8 .cse9 .cse13 .cse12) (or .cse0 .cse15 .cse7 .cse9 .cse11 (and .cse2 .cse10 .cse3 .cse14) .cse12)))) [2020-11-06 22:53:21,981 INFO L262 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse10 (= |old(~t1_pc~0)| 1)) (.cse9 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (let ((.cse3 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) .cse2 (<= .cse3 ~token~0) (<= ~token~0 .cse3) .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (= |old(~m_st~0)| 0)) .cse10 .cse5 .cse6 .cse7 .cse11 .cse9) (or .cse10 .cse5 .cse7 .cse8 .cse9) (or (and .cse1 .cse2 .cse4) .cse5 .cse7 .cse11 .cse8))) [2020-11-06 22:53:21,981 INFO L266 CegarLoopResult]: For program point L101-1(line 101) no Hoare annotation was computed. [2020-11-06 22:53:21,981 INFO L266 CegarLoopResult]: For program point immediate_notifyEXIT(lines 328 338) no Hoare annotation was computed. [2020-11-06 22:53:21,982 INFO L262 CegarLoopResult]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse5 (not (<= 2 ~E_M~0))) (.cse7 (= |old(~m_st~0)| 0)) (.cse3 (= ~m_pc~0 1)) (.cse6 (not .cse8)) (.cse0 (= ~E_M~0 0)) (.cse2 (not (= ~t1_i~0 1))) (.cse1 (and .cse9 (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (not (<= 2 |old(~t1_st~0)|)) (not (<= ~token~0 ~local~0)) .cse7 .cse2 .cse1 (not (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) .cse5 .cse8 .cse7 .cse2 .cse3 (and .cse9 (= ~t1_st~0 0))) (let ((.cse10 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse0 .cse2 .cse1 .cse4 (not (<= 2 ~E_1~0))))))) [2020-11-06 22:53:21,982 INFO L266 CegarLoopResult]: For program point immediate_notifyFINAL(lines 328 338) no Hoare annotation was computed. [2020-11-06 22:53:21,982 INFO L266 CegarLoopResult]: For program point L319(lines 319 323) no Hoare annotation was computed. [2020-11-06 22:53:21,982 INFO L266 CegarLoopResult]: For program point L317(line 317) no Hoare annotation was computed. [2020-11-06 22:53:21,982 INFO L266 CegarLoopResult]: For program point L319-2(lines 303 327) no Hoare annotation was computed. [2020-11-06 22:53:21,982 INFO L266 CegarLoopResult]: For program point L311(lines 311 315) no Hoare annotation was computed. [2020-11-06 22:53:21,982 INFO L262 CegarLoopResult]: At program point L309(line 309) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse9 (= |old(~m_st~0)| 0)) (.cse22 (+ ~local~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= ~t1_st~0 0))) (let ((.cse8 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse3 (= ~m_pc~0 1)) (.cse18 (and .cse23 .cse16)) (.cse0 (= ~E_M~0 0)) (.cse1 (and .cse23 .cse21)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not .cse15)) (.cse19 (not (<= ~token~0 .cse22))) (.cse11 (not .cse9)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (<= .cse22 ~token~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse12 (and .cse17 .cse21)) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse1 .cse10) (or .cse5 .cse6 .cse11 .cse7 .cse8 .cse2 .cse12 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse11 .cse8 (and .cse16 .cse17) .cse2 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse2 .cse18 .cse4 .cse13) (or .cse14 .cse5 .cse8 .cse2 .cse18 .cse10 .cse4 .cse13) (or .cse14 .cse5 .cse15 .cse9 .cse2 .cse3 .cse18) (or .cse6 .cse19 .cse20 .cse0 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse7 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse19 .cse11 .cse7 .cse20 .cse2 .cse12 .cse13)))) [2020-11-06 22:53:21,983 INFO L262 CegarLoopResult]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= activate_threads_~tmp~1 0)) (.cse19 (< 0 (+ activate_threads_~tmp~1 1))) (.cse6 (= ~m_st~0 0)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= |old(~m_st~0)| 0)) (.cse24 (+ ~local~0 1))) (let ((.cse1 (not (<= ~token~0 .cse24))) (.cse2 (not (<= .cse24 ~token~0))) (.cse13 (not .cse21)) (.cse17 (and .cse18 .cse19 .cse6 .cse7)) (.cse3 (= ~E_M~0 0)) (.cse5 (and .cse23 .cse7)) (.cse15 (= ~m_pc~0 1)) (.cse0 (not .cse12)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse11 (not (<= 2 ~E_M~0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse22 (and .cse23 .cse18 .cse19 .cse7)) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse15 .cse16 .cse9 .cse17) (or .cse11 .cse4 .cse15 (and .cse18 .cse19) .cse8) (or .cse11 .cse0 .cse1 .cse13 .cse20 .cse2 .cse4 .cse9 .cse17) (or .cse10 .cse11 .cse12 .cse21 .cse4 .cse15 .cse22) (or .cse11 .cse0 .cse20 .cse14 .cse21 .cse4 .cse16 .cse22) (or .cse11 .cse0 .cse13 .cse20 .cse14 .cse4 .cse15 .cse16 .cse9 .cse17) (or .cse10 .cse11 .cse12 .cse4 .cse8 .cse22 .cse9) (or .cse3 .cse4 .cse5 .cse15 .cse8) (or .cse11 .cse0 .cse20 .cse4 .cse8 .cse22 .cse9) (or .cse10 .cse11 .cse14 .cse4 .cse16 .cse8 .cse22 .cse9)))) [2020-11-06 22:53:21,983 INFO L266 CegarLoopResult]: For program point L309-1(line 309) no Hoare annotation was computed. [2020-11-06 22:53:21,983 INFO L262 CegarLoopResult]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse9 (= |old(~m_st~0)| 0)) (.cse22 (+ ~local~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= ~t1_st~0 0))) (let ((.cse8 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse3 (= ~m_pc~0 1)) (.cse18 (and .cse23 .cse16)) (.cse0 (= ~E_M~0 0)) (.cse1 (and .cse23 .cse21)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not .cse15)) (.cse19 (not (<= ~token~0 .cse22))) (.cse11 (not .cse9)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (<= .cse22 ~token~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse12 (and .cse17 .cse21)) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse1 .cse10) (or .cse5 .cse6 .cse11 .cse7 .cse8 .cse2 .cse12 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse11 .cse8 (and .cse16 .cse17) .cse2 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse2 .cse18 .cse4 .cse13) (or .cse14 .cse5 .cse8 .cse2 .cse18 .cse10 .cse4 .cse13) (or .cse14 .cse5 .cse15 .cse9 .cse2 .cse3 .cse18) (or .cse6 .cse19 .cse20 .cse0 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse7 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse19 .cse11 .cse7 .cse20 .cse2 .cse12 .cse13)))) [2020-11-06 22:53:21,983 INFO L266 CegarLoopResult]: For program point activate_threadsEXIT(lines 303 327) no Hoare annotation was computed. [2020-11-06 22:53:21,983 INFO L269 CegarLoopResult]: At program point L192(lines 179 194) the Hoare annotation is: true [2020-11-06 22:53:21,983 INFO L266 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 176 195) no Hoare annotation was computed. [2020-11-06 22:53:21,983 INFO L266 CegarLoopResult]: For program point L184(lines 184 189) no Hoare annotation was computed. [2020-11-06 22:53:21,984 INFO L269 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2020-11-06 22:53:21,984 INFO L266 CegarLoopResult]: For program point L180(lines 180 190) no Hoare annotation was computed. [2020-11-06 22:53:21,984 INFO L266 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 176 195) no Hoare annotation was computed. [2020-11-06 22:53:21,984 INFO L266 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 131 149) no Hoare annotation was computed. [2020-11-06 22:53:21,984 INFO L269 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2020-11-06 22:53:21,984 INFO L266 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 131 149) no Hoare annotation was computed. [2020-11-06 22:53:21,984 INFO L262 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 0)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse3 (= ~E_M~0 0)) (.cse0 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~t1_st~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse1 (not .cse8)) (.cse2 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse9 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (= ~m_pc~0 1)) (.cse13 (not .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 (not (= ~M_E~0 2)) .cse2 .cse3 .cse4 .cse6 (not (= ~E_1~0 ~M_E~0))) (or .cse7 .cse8 .cse2 .cse9 .cse4 .cse6 .cse10 .cse11 .cse5) (let ((.cse12 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse12)) .cse2 (not (<= .cse12 ~token~0)) .cse3 .cse4 .cse13 .cse5)) (or .cse7 .cse0 .cse2 .cse4 .cse10 .cse5) (or .cse7 .cse8 .cse2 .cse4 .cse6 .cse10 .cse14) (or .cse7 .cse1 .cse2 .cse9 .cse4 .cse6 (not (<= 2 ~t1_st~0)) .cse13 .cse11 .cse5)))) [2020-11-06 22:53:21,984 INFO L266 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2020-11-06 22:53:21,984 INFO L266 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L262 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0))) (.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))) (.cse11 (not .cse5)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse7 .cse2 .cse3 .cse13 .cse9)) (or .cse0 .cse1 .cse5 .cse7 .cse2 .cse3 .cse8) (or .cse0 .cse11 .cse6 .cse7 .cse2 .cse3 .cse4 .cse13 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse7 .cse2 .cse3 .cse13)))) [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 275 302) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point L294-1(lines 275 302) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2020-11-06 22:53:21,985 INFO L266 CegarLoopResult]: For program point init_threadsEXIT(lines 158 175) no Hoare annotation was computed. [2020-11-06 22:53:21,986 INFO L262 CegarLoopResult]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (<= 2 ~E_M~0)) (not (= ~M_E~0 2)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (not (<= ~token~0 ~local~0)) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (= ~T1_E~0 ~M_E~0)) (not (= ~E_1~0 ~M_E~0)) (not (<= ~local~0 ~token~0))) [2020-11-06 22:53:21,986 INFO L266 CegarLoopResult]: For program point L167-1(lines 158 175) no Hoare annotation was computed. [2020-11-06 22:53:21,986 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 464 475) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (= ~E_1~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (= |old(~t1_i~0)| 1)) [2020-11-06 22:53:21,986 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 464 475) no Hoare annotation was computed. [2020-11-06 22:53:21,986 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 464 475) no Hoare annotation was computed. [2020-11-06 22:53:21,986 INFO L266 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2020-11-06 22:53:21,987 INFO L262 CegarLoopResult]: At program point L469(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (= ~E_1~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (= |old(~t1_i~0)| 1)) [2020-11-06 22:53:21,987 INFO L262 CegarLoopResult]: At program point L469-1(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (= |old(~t1_i~0)| 1)) [2020-11-06 22:53:21,987 INFO L266 CegarLoopResult]: For program point errorEXIT(lines 8 15) no Hoare annotation was computed. [2020-11-06 22:53:21,987 INFO L266 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-06 22:53:21,987 INFO L269 CegarLoopResult]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2020-11-06 22:53:21,987 INFO L266 CegarLoopResult]: For program point errorFINAL(lines 8 15) no Hoare annotation was computed. [2020-11-06 22:53:21,987 INFO L266 CegarLoopResult]: For program point masterEXIT(lines 32 75) no Hoare annotation was computed. [2020-11-06 22:53:21,987 INFO L266 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2020-11-06 22:53:21,988 INFO L262 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse11 (+ |old(~local~0)| 1)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse10)) (.cse3 (not (<= |old(~token~0)| .cse11))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (<= .cse11 |old(~token~0)|))) (.cse0 (not (<= 2 ~E_M~0))) (.cse2 (= |old(~m_pc~0)| 1)) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (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))) .cse8) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse10 .cse2 .cse5 .cse6 .cse7)))) [2020-11-06 22:53:21,988 INFO L262 CegarLoopResult]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~E_1~0)) (.cse14 (= ~t1_i~0 1)) (.cse1 (= ~t1_pc~0 1))) (let ((.cse2 (= |old(~m_pc~0)| 1)) (.cse0 (not (<= 2 ~E_M~0))) (.cse9 (not .cse1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not .cse14)) (.cse11 (and .cse6 .cse1 (= ~t1_st~0 0) (<= ~token~0 ~local~0) .cse14 .cse7 (<= ~local~0 ~token~0))) (.cse12 (and (<= 2 ~t1_st~0) .cse6 .cse1 .cse14 .cse7 .cse8))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8)) (or .cse0 .cse9 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse10 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 .cse5 .cse11 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse9 (not (<= |old(~token~0)| .cse13)) .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 (not (<= .cse13 |old(~token~0)|))))))) [2020-11-06 22:53:21,988 INFO L262 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse8)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (= |old(~m_pc~0)| 1)) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 .cse4 .cse5 .cse6 (not (<= .cse2 |old(~token~0)|)))) (or .cse0 .cse1 .cse7 (not (<= |old(~local~0)| |old(~token~0)|)) .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 .cse6) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse8 .cse7 .cse4 .cse5 .cse6)))) [2020-11-06 22:53:21,988 INFO L262 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse10 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~local~0 |old(~local~0)|) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8) .cse9) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse10 (not (<= |old(~token~0)| .cse11)) .cse12 .cse3 .cse4 .cse9 (let ((.cse13 (+ ~local~0 1))) (and (<= .cse13 ~token~0) (<= ~token~0 .cse13) .cse5 .cse6 .cse7 .cse14 .cse8)) (not (<= .cse11 |old(~token~0)|)))) (or .cse0 .cse10 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse12 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 .cse9 (and .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse14 .cse8))))) [2020-11-06 22:53:21,989 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse16 (+ |old(~local~0)| 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= ~t1_pc~0 1)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse17 (= ~t1_i~0 1)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (= |old(~m_pc~0)| 1)) (.cse11 (and (<= 2 ~t1_st~0) .cse1 .cse3 .cse13 .cse2 .cse17 .cse14 (not (= ~m_st~0 0)) .cse15)) (.cse0 (not (<= 2 ~E_M~0))) (.cse8 (not .cse3)) (.cse9 (not (<= |old(~token~0)| .cse16))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse17)) (.cse12 (not (<= .cse16 |old(~token~0)|)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0) .cse2) .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse4 .cse9 .cse10 .cse11 .cse5 .cse6 .cse7 .cse12) (or .cse0 .cse8 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse10 (not (<= |old(~token~0)| |old(~local~0)|)) .cse11 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 (and .cse1 .cse13 .cse14 .cse15) .cse5 .cse6 .cse7 .cse12)))) [2020-11-06 22:53:21,989 INFO L266 CegarLoopResult]: For program point L53-1(line 53) no Hoare annotation was computed. [2020-11-06 22:53:21,989 INFO L262 CegarLoopResult]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse10 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~local~0 |old(~local~0)|) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8) .cse9) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse10 (not (<= |old(~token~0)| .cse11)) .cse12 .cse3 .cse4 .cse9 (let ((.cse13 (+ ~local~0 1))) (and (<= .cse13 ~token~0) (<= ~token~0 .cse13) .cse5 .cse6 .cse7 .cse14 .cse8)) (not (<= .cse11 |old(~token~0)|)))) (or .cse0 .cse10 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse12 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 .cse9 (and .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse14 .cse8))))) [2020-11-06 22:53:21,989 INFO L266 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-11-06 22:53:21,989 INFO L266 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 339 347) no Hoare annotation was computed. [2020-11-06 22:53:21,989 INFO L262 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse13)) (.cse4 (not (<= 2 ~t1_st~0))) (.cse8 (not (<= ~token~0 ~local~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (<= ~local~0 ~token~0))) (.cse12 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (= ~t1_st~0 0))) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse7 .cse5) (or .cse0 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse6) (let ((.cse11 (+ ~local~0 1))) (or .cse0 .cse2 (not (<= ~token~0 .cse11)) (not (<= .cse11 ~token~0)) .cse3 .cse4 .cse5 .cse12 .cse6)) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse7 .cse5 .cse10 .cse12 .cse6) (or .cse0 .cse13 .cse8 .cse3 .cse7 .cse5 .cse9 .cse10 .cse12 .cse6) (or .cse0 .cse1 .cse13 .cse3 .cse9 .cse5 .cse6)))) [2020-11-06 22:53:21,989 INFO L266 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 339 347) no Hoare annotation was computed. [2020-11-06 22:53:21,990 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:53:21,990 INFO L262 CegarLoopResult]: 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)|)) [2020-11-06 22:53:21,990 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:53:21,990 INFO L269 CegarLoopResult]: At program point L401(lines 390 403) the Hoare annotation is: true [2020-11-06 22:53:21,990 INFO L266 CegarLoopResult]: For program point L394(lines 394 399) no Hoare annotation was computed. [2020-11-06 22:53:21,990 INFO L269 CegarLoopResult]: At program point L392(line 392) the Hoare annotation is: true [2020-11-06 22:53:21,990 INFO L266 CegarLoopResult]: For program point L392-1(line 392) no Hoare annotation was computed. [2020-11-06 22:53:21,990 INFO L266 CegarLoopResult]: For program point stop_simulationEXIT(lines 386 404) no Hoare annotation was computed. [2020-11-06 22:53:21,990 INFO L269 CegarLoopResult]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2020-11-06 22:53:21,991 INFO L266 CegarLoopResult]: For program point stop_simulationFINAL(lines 386 404) no Hoare annotation was computed. [2020-11-06 22:53:21,991 INFO L262 CegarLoopResult]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (let ((.cse26 (= ~local~0 |old(~local~0)|)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse7 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse25 (= |old(~t1_pc~0)| 1))) (let ((.cse16 (not .cse25)) (.cse19 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (not (= |old(~m_st~0)| 0))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (<= ~token~0 ~local~0)) (.cse21 (= ~m_st~0 0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= ~t1_st~0 0)) (.cse23 (= |old(~m_pc~0)| 1)) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~t1_i~0 1))) (.cse24 (and .cse26 .cse1 .cse2 .cse4 .cse7 .cse22 .cse8 .cse9)) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse16 .cse17 (not (<= |old(~token~0)| .cse18)) .cse19 (let ((.cse20 (+ ~local~0 1))) (and (<= .cse20 ~token~0) (<= ~token~0 .cse20) .cse2 .cse4 .cse21 .cse7 .cse22 .cse8 .cse9)) .cse12 .cse13 .cse14 (not (<= .cse18 |old(~token~0)|)))) (or .cse16 .cse23 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 (and .cse2 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse9)) (or .cse16 .cse19 .cse12 .cse13 .cse14 .cse24 .cse15) (or .cse0 .cse23 .cse17 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 (and .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9)) (or .cse0 .cse12 .cse25 .cse13 .cse14 (and .cse26 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9) .cse15) (or .cse23 .cse13 .cse14 .cse24 .cse15)))) [2020-11-06 22:53:21,991 INFO L266 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2020-11-06 22:53:21,991 INFO L266 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-11-06 22:53:21,991 INFO L266 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2020-11-06 22:53:21,991 INFO L266 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2020-11-06 22:53:21,992 INFO L262 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse24 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse35 (= ~t1_i~0 1)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 0)) (.cse28 (<= 2 ~E_M~0))) (let ((.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse0 (let ((.cse36 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse7 .cse27 .cse11 .cse28))) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse25 .cse7 .cse26 .cse10 .cse35 .cse27 .cse12 .cse28)) (.cse5 (and .cse23 .cse25 .cse7 .cse35 .cse27 .cse28)) (.cse1 (not .cse29)) (.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (<= 2 |old(~E_1~0)|))) (.cse33 (= ~local~0 |old(~local~0)|)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (and .cse25 .cse24 .cse35 .cse28)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not .cse35)) (.cse32 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse16 .cse17 .cse19 (and .cse23 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse25 (not .cse7) .cse26 .cse27 .cse28) .cse20 .cse29 .cse21 (and .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15)) (let ((.cse31 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse16 .cse3 (not (<= |old(~token~0)| .cse31)) .cse18 .cse4 .cse20 .cse21 .cse5 .cse6 (not (<= .cse31 |old(~token~0)|)))) (or .cse22 .cse0 .cse1 .cse16 .cse17 .cse19 .cse4 .cse20 .cse21 .cse5 .cse6 .cse32) (or .cse1 .cse16 .cse18 .cse20 .cse21 .cse6 (and .cse33 .cse7 .cse34 .cse8 .cse13 .cse14 .cse15) .cse32) (or .cse22 .cse16 .cse20 .cse29 .cse21 .cse6 (and .cse23 .cse25 .cse7 .cse8 .cse14) (and .cse33 .cse34 .cse8 .cse30 .cse13 .cse14 .cse15) .cse32) (or .cse16 .cse2 .cse21 .cse6 .cse32) (or (not (= ~M_E~0 2)) .cse2 .cse8 .cse21 .cse6 .cse32)))) [2020-11-06 22:53:21,992 INFO L262 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (let ((.cse14 (<= ~token~0 ~local~0)) (.cse20 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse19 (<= 2 ~m_st~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse24 (= ~t1_i~0 1)) (.cse21 (<= 2 ~E_M~0)) (.cse22 (= |old(~t1_pc~0)| 1)) (.cse25 (= ~t1_pc~0 1))) (let ((.cse12 (not .cse25)) (.cse17 (= ~E_M~0 |old(~E_M~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= |old(~m_pc~0)| 1)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse22)) (.cse1 (and .cse19 .cse15 .cse24 .cse21)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (and .cse19 .cse25 .cse14 .cse20 .cse16 .cse21)) (.cse7 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not .cse24)) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse5 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse3 (and .cse12 .cse13 .cse14 .cse15 (= ~m_st~0 0) .cse16 .cse17 (= |old(~token~0)| ~token~0)) .cse10 .cse18 .cse1 .cse4 .cse7 (and .cse19 .cse14 .cse20 .cse16 .cse21) .cse8 .cse22 .cse9 (and .cse19 .cse12 .cse20 .cse21)) (or .cse18 .cse1 (and .cse19 .cse12 .cse13 .cse17) .cse8 .cse22 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse9 .cse10 .cse11) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 (not (<= |old(~token~0)| .cse23)) .cse5 .cse6 .cse8 .cse9 .cse10 (not (<= .cse23 |old(~token~0)|)))) (or (not (= ~M_E~0 2)) .cse2 .cse13 .cse9 .cse10 .cse11) (or .cse18 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2020-11-06 22:53:21,993 INFO L262 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse24 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse35 (= ~t1_i~0 1)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 0)) (.cse28 (<= 2 ~E_M~0))) (let ((.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse0 (let ((.cse36 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse7 .cse27 .cse11 .cse28))) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse25 .cse7 .cse26 .cse10 .cse35 .cse27 .cse12 .cse28)) (.cse5 (and .cse23 .cse25 .cse7 .cse35 .cse27 .cse28)) (.cse1 (not .cse29)) (.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (<= 2 |old(~E_1~0)|))) (.cse33 (= ~local~0 |old(~local~0)|)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (and .cse25 .cse24 .cse35 .cse28)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not .cse35)) (.cse32 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse16 .cse17 .cse19 (and .cse23 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse25 (not .cse7) .cse26 .cse27 .cse28) .cse20 .cse29 .cse21 (and .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15)) (let ((.cse31 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse16 .cse3 (not (<= |old(~token~0)| .cse31)) .cse18 .cse4 .cse20 .cse21 .cse5 .cse6 (not (<= .cse31 |old(~token~0)|)))) (or .cse22 .cse0 .cse1 .cse16 .cse17 .cse19 .cse4 .cse20 .cse21 .cse5 .cse6 .cse32) (or .cse1 .cse16 .cse18 .cse20 .cse21 .cse6 (and .cse33 .cse7 .cse34 .cse8 .cse13 .cse14 .cse15) .cse32) (or .cse22 .cse16 .cse20 .cse29 .cse21 .cse6 (and .cse23 .cse25 .cse7 .cse8 .cse14) (and .cse33 .cse34 .cse8 .cse30 .cse13 .cse14 .cse15) .cse32) (or .cse16 .cse2 .cse21 .cse6 .cse32) (or (not (= ~M_E~0 2)) .cse2 .cse8 .cse21 .cse6 .cse32)))) [2020-11-06 22:53:21,993 INFO L266 CegarLoopResult]: For program point evalEXIT(lines 196 246) no Hoare annotation was computed. [2020-11-06 22:53:21,993 INFO L262 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (let ((.cse14 (= |old(~t1_pc~0)| 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse17 (not (= ~m_pc~0 1))) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (<= 2 ~t1_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse18 (not (= ~m_st~0 0)))) (let ((.cse1 (= |old(~m_pc~0)| 1)) (.cse2 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (let ((.cse22 (+ ~local~0 1))) (and .cse21 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse15 .cse20 (<= 2 ~E_1~0) (<= 2 ~E_M~0) .cse18))) (.cse10 (and .cse21 .cse15 .cse16 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18 .cse19 (= |old(~token~0)| ~token~0))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse14)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not .cse20)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (or .cse1 .cse8 .cse9 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse2 (not (<= |old(~token~0)| .cse13)) .cse4 .cse6 .cse7 .cse8 .cse9 (not (<= .cse13 |old(~token~0)|)))) (or .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 (and (not .cse15) .cse16 (= ~t1_st~0 0) .cse17 .cse18 .cse19) .cse9 .cse10) (or .cse11 .cse7 .cse14 .cse8 .cse9 .cse12) (or .cse0 .cse4 .cse7 .cse8 .cse9 .cse12)))) [2020-11-06 22:53:21,993 INFO L266 CegarLoopResult]: For program point L212(lines 202 240) no Hoare annotation was computed. [2020-11-06 22:53:21,994 INFO L262 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse24 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse35 (= ~t1_i~0 1)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 0)) (.cse28 (<= 2 ~E_M~0))) (let ((.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse0 (let ((.cse36 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse7 .cse27 .cse11 .cse28))) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse25 .cse7 .cse26 .cse10 .cse35 .cse27 .cse12 .cse28)) (.cse5 (and .cse23 .cse25 .cse7 .cse35 .cse27 .cse28)) (.cse1 (not .cse29)) (.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (<= 2 |old(~E_1~0)|))) (.cse33 (= ~local~0 |old(~local~0)|)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (and .cse25 .cse24 .cse35 .cse28)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not .cse35)) (.cse32 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse16 .cse17 .cse19 (and .cse23 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse25 (not .cse7) .cse26 .cse27 .cse28) .cse20 .cse29 .cse21 (and .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15)) (let ((.cse31 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse16 .cse3 (not (<= |old(~token~0)| .cse31)) .cse18 .cse4 .cse20 .cse21 .cse5 .cse6 (not (<= .cse31 |old(~token~0)|)))) (or .cse22 .cse0 .cse1 .cse16 .cse17 .cse19 .cse4 .cse20 .cse21 .cse5 .cse6 .cse32) (or .cse1 .cse16 .cse18 .cse20 .cse21 .cse6 (and .cse33 .cse7 .cse34 .cse8 .cse13 .cse14 .cse15) .cse32) (or .cse22 .cse16 .cse20 .cse29 .cse21 .cse6 (and .cse23 .cse25 .cse7 .cse8 .cse14) (and .cse33 .cse34 .cse8 .cse30 .cse13 .cse14 .cse15) .cse32) (or .cse16 .cse2 .cse21 .cse6 .cse32) (or (not (= ~M_E~0 2)) .cse2 .cse8 .cse21 .cse6 .cse32)))) [2020-11-06 22:53:21,994 INFO L266 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2020-11-06 22:53:21,994 INFO L262 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0))) (.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))) (.cse11 (not .cse5)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse7 .cse2 .cse3 .cse13 .cse9)) (or .cse0 .cse1 .cse5 .cse7 .cse2 .cse3 .cse8) (or .cse0 .cse11 .cse6 .cse7 .cse2 .cse3 .cse4 .cse13 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse7 .cse2 .cse3 .cse13)))) [2020-11-06 22:53:21,994 INFO L266 CegarLoopResult]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2020-11-06 22:53:21,994 INFO L266 CegarLoopResult]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2020-11-06 22:53:21,994 INFO L266 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 247 274) no Hoare annotation was computed. [2020-11-06 22:53:21,994 INFO L266 CegarLoopResult]: For program point L266-1(lines 247 274) no Hoare annotation was computed. [2020-11-06 22:53:21,995 INFO L266 CegarLoopResult]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2020-11-06 22:53:21,995 INFO L266 CegarLoopResult]: For program point update_channelsEXIT(lines 150 157) no Hoare annotation was computed. [2020-11-06 22:53:21,995 INFO L269 CegarLoopResult]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2020-11-06 22:53:21,995 INFO L262 CegarLoopResult]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (and (not (= ~t1_pc~0 1)) .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 (= ~m_st~0 0) (<= ~local~0 ~token~0) .cse4 .cse5 (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-06 22:53:21,995 INFO L262 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|))) [2020-11-06 22:53:21,995 INFO L262 CegarLoopResult]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|))) [2020-11-06 22:53:21,996 INFO L266 CegarLoopResult]: For program point start_simulationEXIT(lines 405 463) no Hoare annotation was computed. [2020-11-06 22:53:21,996 INFO L262 CegarLoopResult]: At program point L442(line 442) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (and .cse6 .cse0 .cse2 .cse3 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (not (<= 2 |old(~E_M~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,996 INFO L262 CegarLoopResult]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,996 INFO L262 CegarLoopResult]: At program point L434(line 434) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,997 INFO L262 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,997 INFO L262 CegarLoopResult]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,997 INFO L262 CegarLoopResult]: At program point L428(line 428) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,997 INFO L266 CegarLoopResult]: For program point L428-1(line 428) no Hoare annotation was computed. [2020-11-06 22:53:21,998 INFO L262 CegarLoopResult]: At program point L424(line 424) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,998 INFO L266 CegarLoopResult]: For program point L424-1(line 424) no Hoare annotation was computed. [2020-11-06 22:53:21,998 INFO L262 CegarLoopResult]: At program point L420-1(lines 417 457) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,998 INFO L262 CegarLoopResult]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|))) [2020-11-06 22:53:21,998 INFO L262 CegarLoopResult]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and (not (= ~t1_pc~0 1)) .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 (= ~m_st~0 0) (<= ~local~0 ~token~0) .cse5 (= |old(~token~0)| ~token~0)))) [2020-11-06 22:53:21,999 INFO L262 CegarLoopResult]: 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 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (and (not (= ~t1_pc~0 1)) .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 (= ~m_st~0 0) (<= ~local~0 ~token~0) .cse4 .cse5 (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-06 22:53:21,999 INFO L262 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,999 INFO L266 CegarLoopResult]: For program point L439(lines 439 448) no Hoare annotation was computed. [2020-11-06 22:53:21,999 INFO L262 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:21,999 INFO L266 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2020-11-06 22:53:22,000 INFO L262 CegarLoopResult]: At program point L433(line 433) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-11-06 22:53:22,000 INFO L269 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-11-06 22:53:22,000 INFO L266 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2020-11-06 22:53:22,000 INFO L266 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2020-11-06 22:53:22,000 INFO L266 CegarLoopResult]: For program point L450(line 450) no Hoare annotation was computed. [2020-11-06 22:53:22,000 INFO L262 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse12 (not (<= 2 ~m_st~0))) (.cse4 (= ~m_pc~0 1)) (.cse5 (not (= ~t1_st~0 0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (not .cse2)) (.cse1 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse8 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse6 (= ~m_st~0 0)) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11) (or .cse12 .cse1 (= ~E_M~0 0) .cse3 .cse4) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse7 (not (<= ~token~0 .cse13)) .cse1 (not (<= .cse13 ~token~0)) .cse3 .cse9 (not .cse6) .cse11)) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse11) (or .cse0 .cse12 .cse7 .cse1 .cse3 .cse9 .cse11) (or .cse0 .cse12 .cse1 .cse8 .cse3 .cse5 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse10 .cse11) (or .cse0 .cse7 .cse1 .cse8 .cse3 .cse9 .cse6 .cse10)))) [2020-11-06 22:53:22,000 INFO L266 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 112 130) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 112 130) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L269 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~E_1~0 ~M_E~0) (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (not (= ~m_pc~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2020-11-06 22:53:22,001 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2020-11-06 22:53:22,001 INFO L266 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 348 375) no Hoare annotation was computed. [2020-11-06 22:53:22,002 INFO L262 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 348 375) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0))) (.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))) (.cse11 (not .cse5)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse7 .cse2 .cse3 .cse13 .cse9)) (or .cse0 .cse1 .cse5 .cse7 .cse2 .cse3 .cse8) (or .cse0 .cse11 .cse6 .cse7 .cse2 .cse3 .cse4 .cse13 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse7 .cse2 .cse3 .cse13)))) [2020-11-06 22:53:22,002 INFO L266 CegarLoopResult]: For program point L367-1(lines 348 375) no Hoare annotation was computed. [2020-11-06 22:53:22,002 INFO L266 CegarLoopResult]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2020-11-06 22:53:22,002 INFO L266 CegarLoopResult]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2020-11-06 22:53:22,002 INFO L266 CegarLoopResult]: For program point init_modelFINAL(lines 376 385) no Hoare annotation was computed. [2020-11-06 22:53:22,002 INFO L266 CegarLoopResult]: For program point init_modelEXIT(lines 376 385) no Hoare annotation was computed. [2020-11-06 22:53:22,002 INFO L262 CegarLoopResult]: At program point init_modelENTRY(lines 376 385) the Hoare annotation is: (or (not (<= 2 ~E_M~0)) (not (= ~M_E~0 2)) (= ~t1_pc~0 1) (not (<= ~token~0 ~local~0)) (= ~m_pc~0 1) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~T1_E~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 ~M_E~0)) (not (<= ~local~0 ~token~0)) (= |old(~t1_i~0)| 1)) [2020-11-06 22:53:22,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:53:22 BoogieIcfgContainer [2020-11-06 22:53:22,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:53:22,069 INFO L168 Benchmark]: Toolchain (without parser) took 112294.33 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 127.2 MB in the beginning and 455.1 MB in the end (delta: -327.9 MB). Peak memory consumption was 757.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:53:22,070 INFO L168 Benchmark]: CDTParser took 3.26 ms. Allocated memory is still 125.8 MB. Free memory was 102.5 MB in the beginning and 102.5 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:53:22,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.10 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 113.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:53:22,071 INFO L168 Benchmark]: Boogie Preprocessor took 53.75 ms. Allocated memory is still 151.0 MB. Free memory was 113.9 MB in the beginning and 112.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:53:22,071 INFO L168 Benchmark]: RCFGBuilder took 703.43 ms. Allocated memory is still 151.0 MB. Free memory was 111.9 MB in the beginning and 112.4 MB in the end (delta: -495.6 kB). Peak memory consumption was 13.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:53:22,072 INFO L168 Benchmark]: TraceAbstraction took 111191.67 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 111.9 MB in the beginning and 455.1 MB in the end (delta: -343.1 MB). Peak memory consumption was 739.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:53:22,074 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.26 ms. Allocated memory is still 125.8 MB. Free memory was 102.5 MB in the beginning and 102.5 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 333.10 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 113.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.75 ms. Allocated memory is still 151.0 MB. Free memory was 113.9 MB in the beginning and 112.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 703.43 ms. Allocated memory is still 151.0 MB. Free memory was 111.9 MB in the beginning and 112.4 MB in the end (delta: -495.6 kB). Peak memory consumption was 13.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 111191.67 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 111.9 MB in the beginning and 455.1 MB in the end (delta: -343.1 MB). Peak memory consumption was 739.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || m_st == 0) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((!(2 <= m_st) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || !(t1_i == 1)) || m_pc == 1)) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || !(t1_i == 1)) || !(t1_st == 0)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(local <= token)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || ((((((((t1_pc == 1 && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) && (((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(t1_st) == 0)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && !(m_pc == 1)) && token <= local) && m_st == 0) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || ((((2 <= m_st && !(t1_pc == 1)) && t1_st == 0) && 2 <= E_1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || ((((((((E_1 == \old(E_1) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && \old(t1_pc) == t1_pc) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token))) && (((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(m_st) == 0)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(local) + 1 <= \old(token)))) && (((((((((((!(\old(t1_st) == 0) || ((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M)) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((((!(\old(t1_pc) == 1) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((((local == \old(local) && t1_pc == 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_1 == \old(E_1)) && E_M == \old(E_M))) || ((((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && (((((((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M) || \old(m_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((!(M_E == 2) || \old(m_pc) == 1) || E_1 == \old(E_1)) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((((((((((2 <= m_st && !(m_pc == 1)) && 2 <= E_M) || !(\old(token) <= local)) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && m_st == 0) && 2 <= E_M)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || (((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((2 <= m_st && !(m_pc == 1)) && 2 <= E_M) || !(2 <= \old(E_M))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && ((((((((!(\old(token) <= local) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && ((((((((2 <= m_st && !(m_pc == 1)) && 2 <= E_M) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M))) || !(2 <= E_1)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((!(\old(token) <= local) || !(\old(m_st) == 0)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) && ((((\old(t1_pc) == 1 || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(\old(token) <= local) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(2 <= \old(E_M))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= \old(m_st))) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(T1_E) == \old(M_E))) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token) && 2 <= E_M)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(2 == \old(M_E))) || ((((((((!(t1_pc == 1) && t1_st == 0) && !(m_pc == 1)) && token <= local) && 2 <= E_1) && m_st == 0) && local <= token) && 2 <= E_M) && \old(token) == token)) || !(\old(E_1) == \old(M_E))) || ((2 <= m_st && !(m_pc == 1)) && 2 <= E_M)) || !(\old(t1_st) == 0)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((((2 <= m_st && !(t1_pc == 1)) && t1_st == 0) && 2 <= E_1) && 2 <= E_M)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || ((((((((2 <= t1_st && t1_pc == 1) && token <= local) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && local <= token) && 2 <= E_M) && \old(token) == token) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || ((((((((t1_pc == 1 && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) && (((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(t1_st) == 0)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && !(m_pc == 1)) && token <= local) && m_st == 0) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || ((((2 <= m_st && !(t1_pc == 1)) && t1_st == 0) && 2 <= E_1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || ((((((((E_1 == \old(E_1) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && \old(t1_pc) == t1_pc) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token))) && (((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(m_st) == 0)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(local) + 1 <= \old(token)))) && (((((((((((!(\old(t1_st) == 0) || ((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M)) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((((!(\old(t1_pc) == 1) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((((local == \old(local) && t1_pc == 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_1 == \old(E_1)) && E_M == \old(E_M))) || ((((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && (((((((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M) || \old(m_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((!(M_E == 2) || \old(m_pc) == 1) || E_1 == \old(E_1)) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(local) + 1 <= \old(token))) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1))) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\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)) || !(\old(local) + 1 <= \old(token)))) && ((((((!(\old(t1_st) == 0) || !(2 <= E_M)) || t1_pc == 1) || \old(m_pc) == 1) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(2 <= E_M)) || t1_pc == 1) || \old(m_pc) == 1) || \old(m_st) == 0) || !(2 <= \old(E_1))) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && t1_st == 0) && m_pc == \old(m_pc)) && \old(token) == token)) || !(t1_i == 1)) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\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)) || !(\old(local) + 1 <= \old(token)))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((m_st == \old(m_st) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && \old(token) == token)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || !(t1_i == 1)) || !(2 <= E_1)) && ((((((!(2 <= m_st) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(E_1 == M_E))) && ((((((((!(2 <= E_M) || t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((!(t1_pc == 1) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || E_M == 0) || !(t1_i == 1)) || !(m_st == 0)) || !(2 <= E_1))) && (((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || m_st == 0)) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || !(m_st == 0)) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= E_M && \old(t1_st) == t1_st) || (t1_st == 0 && 2 <= E_M)) && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && t1_i == 1) && m_st == 0) || !(\old(token) <= local)) || (((2 <= m_st && ((2 <= E_M && \old(t1_st) == t1_st) || (t1_st == 0 && 2 <= E_M))) && t1_pc == 1) && t1_i == 1)) || !(\old(t1_pc) == 1)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((!(M_E == 2) || !(2 <= \old(E_M))) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || m_pc == 1) || !(E_1 == M_E)) || !(2 <= \old(m_st)))) && ((((!(2 <= \old(E_M)) || !(t1_i == 1)) || m_pc == 1) || (2 <= m_st && ((((m_st == \old(m_st) && !(m_pc == 1)) && \old(t1_st) == t1_st) && 2 <= E_M) || ((t1_st == 0 && !(m_pc == 1)) && 2 <= E_M)))) || !(2 <= \old(m_st)))) && ((((((((((((m_st == 0 && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(\old(token) <= local)) || !(\old(m_st) == 0)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && ((((((((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || (2 <= m_st && ((((m_st == \old(m_st) && !(m_pc == 1)) && \old(t1_st) == t1_st) && 2 <= E_M) || ((t1_st == 0 && !(m_pc == 1)) && 2 <= E_M)))) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(2 <= E_M)) || t1_pc == 1) || \old(m_pc) == 1) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((2 <= m_st && 2 <= E_1) && \old(t1_st) == t1_st)) && ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && \old(t1_st) == t1_st))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && \old(t1_st) == t1_st)) || !(\old(local) + 1 <= \old(token))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 41.7s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 69.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2572 SDtfs, 9075 SDslu, 777 SDs, 0 SdLazy, 16580 SolverSat, 5547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1333 GetRequests, 1041 SyntacticMatches, 6 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4770occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 4383 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 9596 PreInvPairs, 12181 NumberOfFragments, 11480 HoareAnnotationTreeSize, 9596 FomulaSimplifications, 454330554 FormulaSimplificationTreeSizeReduction, 26.7s HoareSimplificationTime, 63 FomulaSimplificationsInter, 1351444 FormulaSimplificationTreeSizeReductionInter, 42.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2208 NumberOfCodeBlocks, 2208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2190 ConstructedInterpolants, 0 QuantifiedInterpolants, 747619 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 773/807 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...