/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 01:26:09,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 01:26:09,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 01:26:09,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 01:26:09,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 01:26:09,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 01:26:09,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 01:26:09,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 01:26:09,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 01:26:09,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 01:26:09,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 01:26:09,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 01:26:09,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 01:26:09,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 01:26:09,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 01:26:09,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 01:26:09,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 01:26:09,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 01:26:09,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 01:26:09,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 01:26:09,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 01:26:09,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 01:26:09,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 01:26:09,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 01:26:09,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 01:26:09,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 01:26:09,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 01:26:09,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 01:26:09,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 01:26:09,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 01:26:09,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 01:26:09,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 01:26:09,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 01:26:09,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 01:26:09,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 01:26:09,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 01:26:09,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 01:26:09,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 01:26:09,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 01:26:09,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 01:26:09,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 01:26:09,433 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 [2023-03-31 01:26:09,463 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 01:26:09,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 01:26:09,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 01:26:09,464 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 01:26:09,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 01:26:09,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 01:26:09,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 01:26:09,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 01:26:09,466 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 01:26:09,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 01:26:09,466 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 01:26:09,467 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 01:26:09,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 01:26:09,468 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 01:26:09,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 01:26:09,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 01:26:09,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 01:26:09,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 01:26:09,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:26:09,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 01:26:09,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 01:26:09,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 01:26:09,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 01:26:09,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 01:26:09,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 01:26:09,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 01:26:09,470 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 01:26:09,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 01:26:09,470 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 01:26:09,470 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-03-31 01:26:09,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 01:26:09,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 01:26:09,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 01:26:09,730 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 01:26:09,730 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 01:26:09,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-03-31 01:26:10,911 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 01:26:11,088 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 01:26:11,088 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-03-31 01:26:11,096 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67cbb7833/7fd13adc41dc4454a3fb40f683856670/FLAGdf54ae4a7 [2023-03-31 01:26:11,109 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67cbb7833/7fd13adc41dc4454a3fb40f683856670 [2023-03-31 01:26:11,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 01:26:11,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 01:26:11,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 01:26:11,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 01:26:11,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 01:26:11,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501bb61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11, skipping insertion in model container [2023-03-31 01:26:11,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 01:26:11,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 01:26:11,263 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-03-31 01:26:11,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:26:11,313 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 01:26:11,323 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-03-31 01:26:11,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:26:11,366 INFO L208 MainTranslator]: Completed translation [2023-03-31 01:26:11,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11 WrapperNode [2023-03-31 01:26:11,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 01:26:11,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 01:26:11,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 01:26:11,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 01:26:11,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,403 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 01:26:11,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 01:26:11,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 01:26:11,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 01:26:11,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (1/1) ... [2023-03-31 01:26:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:26:11,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:26:11,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-31 01:26:11,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-31 01:26:11,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 01:26:11,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2023-03-31 01:26:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-03-31 01:26:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-03-31 01:26:11,484 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-03-31 01:26:11,484 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-03-31 01:26:11,484 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-03-31 01:26:11,484 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-03-31 01:26:11,484 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-03-31 01:26:11,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 01:26:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 01:26:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 01:26:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 01:26:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-03-31 01:26:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-03-31 01:26:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 01:26:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 01:26:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 01:26:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 01:26:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 01:26:11,555 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 01:26:11,558 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 01:26:11,990 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 01:26:11,998 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 01:26:11,998 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-03-31 01:26:12,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:26:12 BoogieIcfgContainer [2023-03-31 01:26:12,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 01:26:12,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 01:26:12,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 01:26:12,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 01:26:12,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 01:26:11" (1/3) ... [2023-03-31 01:26:12,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb0078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:26:12, skipping insertion in model container [2023-03-31 01:26:12,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:26:11" (2/3) ... [2023-03-31 01:26:12,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb0078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:26:12, skipping insertion in model container [2023-03-31 01:26:12,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:26:12" (3/3) ... [2023-03-31 01:26:12,008 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-03-31 01:26:12,027 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 01:26:12,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 01:26:12,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 01:26:12,103 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1471b67f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 01:26:12,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 01:26:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 114 states have (on average 1.5175438596491229) internal successors, (173), 121 states have internal predecessors, (173), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-03-31 01:26:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:12,126 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:12,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:12,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:12,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -228882314, now seen corresponding path program 1 times [2023-03-31 01:26:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895476921] [2023-03-31 01:26:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895476921] [2023-03-31 01:26:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895476921] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204926077] [2023-03-31 01:26:12,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:12,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:12,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:12,973 INFO L87 Difference]: Start difference. First operand has 169 states, 114 states have (on average 1.5175438596491229) internal successors, (173), 121 states have internal predecessors, (173), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:14,144 INFO L93 Difference]: Finished difference Result 408 states and 628 transitions. [2023-03-31 01:26:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-31 01:26:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-03-31 01:26:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:14,162 INFO L225 Difference]: With dead ends: 408 [2023-03-31 01:26:14,163 INFO L226 Difference]: Without dead ends: 247 [2023-03-31 01:26:14,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-03-31 01:26:14,170 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1060 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:14,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 40 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:26:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-03-31 01:26:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2023-03-31 01:26:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.385321100917431) internal successors, (151), 114 states have internal predecessors, (151), 31 states have call successors, (31), 22 states have call predecessors, (31), 19 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-03-31 01:26:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2023-03-31 01:26:14,278 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 90 [2023-03-31 01:26:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:14,279 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2023-03-31 01:26:14,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2023-03-31 01:26:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:14,283 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:14,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:14,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 01:26:14,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:14,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1954509130, now seen corresponding path program 1 times [2023-03-31 01:26:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357045588] [2023-03-31 01:26:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357045588] [2023-03-31 01:26:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357045588] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:14,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472464481] [2023-03-31 01:26:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:14,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:14,569 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:15,421 INFO L93 Difference]: Finished difference Result 387 states and 548 transitions. [2023-03-31 01:26:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 01:26:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-03-31 01:26:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:15,429 INFO L225 Difference]: With dead ends: 387 [2023-03-31 01:26:15,429 INFO L226 Difference]: Without dead ends: 247 [2023-03-31 01:26:15,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-03-31 01:26:15,432 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1059 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:15,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 16 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-31 01:26:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-03-31 01:26:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2023-03-31 01:26:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 114 states have internal predecessors, (148), 31 states have call successors, (31), 22 states have call predecessors, (31), 19 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-03-31 01:26:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2023-03-31 01:26:15,477 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 90 [2023-03-31 01:26:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:15,477 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2023-03-31 01:26:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2023-03-31 01:26:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:15,479 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:15,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:15,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 01:26:15,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:15,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash -763248522, now seen corresponding path program 1 times [2023-03-31 01:26:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658200316] [2023-03-31 01:26:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:15,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658200316] [2023-03-31 01:26:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658200316] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:15,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:15,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408760665] [2023-03-31 01:26:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:15,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:15,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:15,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:15,710 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:16,822 INFO L93 Difference]: Finished difference Result 466 states and 682 transitions. [2023-03-31 01:26:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 01:26:16,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-03-31 01:26:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:16,833 INFO L225 Difference]: With dead ends: 466 [2023-03-31 01:26:16,834 INFO L226 Difference]: Without dead ends: 326 [2023-03-31 01:26:16,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-03-31 01:26:16,840 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 945 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:16,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 16 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:26:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-03-31 01:26:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 196. [2023-03-31 01:26:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.3235294117647058) internal successors, (180), 141 states have internal predecessors, (180), 35 states have call successors, (35), 27 states have call predecessors, (35), 24 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-03-31 01:26:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 247 transitions. [2023-03-31 01:26:16,919 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 247 transitions. Word has length 90 [2023-03-31 01:26:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:16,920 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 247 transitions. [2023-03-31 01:26:16,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 247 transitions. [2023-03-31 01:26:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:16,921 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:16,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:16,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 01:26:16,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:16,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1845538936, now seen corresponding path program 1 times [2023-03-31 01:26:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973582032] [2023-03-31 01:26:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:17,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:17,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973582032] [2023-03-31 01:26:17,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973582032] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:17,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:17,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:26:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189666728] [2023-03-31 01:26:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:17,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:26:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:26:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:26:17,170 INFO L87 Difference]: Start difference. First operand 196 states and 247 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:19,098 INFO L93 Difference]: Finished difference Result 1033 states and 1417 transitions. [2023-03-31 01:26:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-31 01:26:19,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-03-31 01:26:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:19,104 INFO L225 Difference]: With dead ends: 1033 [2023-03-31 01:26:19,104 INFO L226 Difference]: Without dead ends: 857 [2023-03-31 01:26:19,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-03-31 01:26:19,106 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1312 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:19,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 16 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:26:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-03-31 01:26:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 649. [2023-03-31 01:26:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 473 states have (on average 1.3530655391120507) internal successors, (640), 504 states have internal predecessors, (640), 98 states have call successors, (98), 72 states have call predecessors, (98), 77 states have return successors, (136), 96 states have call predecessors, (136), 95 states have call successors, (136) [2023-03-31 01:26:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 874 transitions. [2023-03-31 01:26:19,263 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 874 transitions. Word has length 90 [2023-03-31 01:26:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:19,264 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 874 transitions. [2023-03-31 01:26:19,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 874 transitions. [2023-03-31 01:26:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:19,269 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:19,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:19,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 01:26:19,270 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:19,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1791146038, now seen corresponding path program 1 times [2023-03-31 01:26:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682242520] [2023-03-31 01:26:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:19,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:19,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682242520] [2023-03-31 01:26:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682242520] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:19,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:19,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280684722] [2023-03-31 01:26:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:19,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:19,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:19,489 INFO L87 Difference]: Start difference. First operand 649 states and 874 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-03-31 01:26:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:20,822 INFO L93 Difference]: Finished difference Result 1437 states and 1999 transitions. [2023-03-31 01:26:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:26:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2023-03-31 01:26:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:20,827 INFO L225 Difference]: With dead ends: 1437 [2023-03-31 01:26:20,828 INFO L226 Difference]: Without dead ends: 810 [2023-03-31 01:26:20,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-03-31 01:26:20,831 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 616 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:20,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 36 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:26:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2023-03-31 01:26:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 669. [2023-03-31 01:26:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 489 states have (on average 1.3353783231083844) internal successors, (653), 520 states have internal predecessors, (653), 98 states have call successors, (98), 72 states have call predecessors, (98), 81 states have return successors, (140), 100 states have call predecessors, (140), 95 states have call successors, (140) [2023-03-31 01:26:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 891 transitions. [2023-03-31 01:26:20,931 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 891 transitions. Word has length 90 [2023-03-31 01:26:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:20,931 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 891 transitions. [2023-03-31 01:26:20,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-03-31 01:26:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 891 transitions. [2023-03-31 01:26:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:20,933 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:20,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 01:26:20,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:20,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -237440072, now seen corresponding path program 1 times [2023-03-31 01:26:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696593735] [2023-03-31 01:26:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:21,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:21,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696593735] [2023-03-31 01:26:21,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696593735] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:21,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:21,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967384238] [2023-03-31 01:26:21,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:21,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:21,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:21,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:21,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:21,130 INFO L87 Difference]: Start difference. First operand 669 states and 891 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-03-31 01:26:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:22,447 INFO L93 Difference]: Finished difference Result 1472 states and 2024 transitions. [2023-03-31 01:26:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 01:26:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2023-03-31 01:26:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:22,454 INFO L225 Difference]: With dead ends: 1472 [2023-03-31 01:26:22,454 INFO L226 Difference]: Without dead ends: 825 [2023-03-31 01:26:22,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:26:22,458 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 312 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:22,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 38 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:26:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2023-03-31 01:26:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 689. [2023-03-31 01:26:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 505 states have (on average 1.3188118811881189) internal successors, (666), 536 states have internal predecessors, (666), 98 states have call successors, (98), 72 states have call predecessors, (98), 85 states have return successors, (144), 104 states have call predecessors, (144), 95 states have call successors, (144) [2023-03-31 01:26:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 908 transitions. [2023-03-31 01:26:22,566 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 908 transitions. Word has length 90 [2023-03-31 01:26:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:22,566 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 908 transitions. [2023-03-31 01:26:22,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-03-31 01:26:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 908 transitions. [2023-03-31 01:26:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:26:22,568 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:22,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:22,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 01:26:22,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:22,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 10706422, now seen corresponding path program 1 times [2023-03-31 01:26:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287271333] [2023-03-31 01:26:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:22,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287271333] [2023-03-31 01:26:22,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287271333] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:22,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:22,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:26:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799027354] [2023-03-31 01:26:22,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:22,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:26:22,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:26:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:26:22,749 INFO L87 Difference]: Start difference. First operand 689 states and 908 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:24,347 INFO L93 Difference]: Finished difference Result 2239 states and 3112 transitions. [2023-03-31 01:26:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 01:26:24,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-03-31 01:26:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:24,355 INFO L225 Difference]: With dead ends: 2239 [2023-03-31 01:26:24,356 INFO L226 Difference]: Without dead ends: 1572 [2023-03-31 01:26:24,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-03-31 01:26:24,359 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1563 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:24,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 15 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:26:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-03-31 01:26:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1352. [2023-03-31 01:26:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1004 states have (on average 1.3057768924302788) internal successors, (1311), 1061 states have internal predecessors, (1311), 181 states have call successors, (181), 135 states have call predecessors, (181), 166 states have return successors, (281), 194 states have call predecessors, (281), 177 states have call successors, (281) [2023-03-31 01:26:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1773 transitions. [2023-03-31 01:26:24,572 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1773 transitions. Word has length 90 [2023-03-31 01:26:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:24,572 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1773 transitions. [2023-03-31 01:26:24,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-03-31 01:26:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1773 transitions. [2023-03-31 01:26:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:26:24,574 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:24,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:24,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-03-31 01:26:24,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:24,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1419031621, now seen corresponding path program 1 times [2023-03-31 01:26:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:24,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852832934] [2023-03-31 01:26:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-03-31 01:26:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:26:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-03-31 01:26:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852832934] [2023-03-31 01:26:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852832934] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:24,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:26:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694260728] [2023-03-31 01:26:24,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:24,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:26:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:26:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:26:24,765 INFO L87 Difference]: Start difference. First operand 1352 states and 1773 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-03-31 01:26:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:26,250 INFO L93 Difference]: Finished difference Result 3058 states and 4232 transitions. [2023-03-31 01:26:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 01:26:26,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2023-03-31 01:26:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:26,261 INFO L225 Difference]: With dead ends: 3058 [2023-03-31 01:26:26,261 INFO L226 Difference]: Without dead ends: 1728 [2023-03-31 01:26:26,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:26:26,267 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 635 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:26,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 38 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:26:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2023-03-31 01:26:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1475. [2023-03-31 01:26:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1088 states have (on average 1.2996323529411764) internal successors, (1414), 1167 states have internal predecessors, (1414), 199 states have call successors, (199), 135 states have call predecessors, (199), 187 states have return successors, (374), 225 states have call predecessors, (374), 195 states have call successors, (374) [2023-03-31 01:26:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1987 transitions. [2023-03-31 01:26:26,505 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1987 transitions. Word has length 109 [2023-03-31 01:26:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:26,507 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 1987 transitions. [2023-03-31 01:26:26,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 7 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-03-31 01:26:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1987 transitions. [2023-03-31 01:26:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:26:26,510 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:26,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 01:26:26,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:26,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1337595645, now seen corresponding path program 1 times [2023-03-31 01:26:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364925059] [2023-03-31 01:26:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-03-31 01:26:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:26:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-03-31 01:26:26,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:26,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364925059] [2023-03-31 01:26:26,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364925059] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:26,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:26,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:26,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293339562] [2023-03-31 01:26:26,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:26,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:26,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:26,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:26,720 INFO L87 Difference]: Start difference. First operand 1475 states and 1987 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:28,978 INFO L93 Difference]: Finished difference Result 3980 states and 5565 transitions. [2023-03-31 01:26:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-31 01:26:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2023-03-31 01:26:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:28,990 INFO L225 Difference]: With dead ends: 3980 [2023-03-31 01:26:28,990 INFO L226 Difference]: Without dead ends: 2526 [2023-03-31 01:26:28,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2023-03-31 01:26:28,997 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1873 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:28,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 17 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [752 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:26:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2023-03-31 01:26:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2148. [2023-03-31 01:26:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1588 states have (on average 1.276448362720403) internal successors, (2027), 1703 states have internal predecessors, (2027), 283 states have call successors, (283), 197 states have call predecessors, (283), 276 states have return successors, (524), 323 states have call predecessors, (524), 279 states have call successors, (524) [2023-03-31 01:26:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2834 transitions. [2023-03-31 01:26:29,318 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 2834 transitions. Word has length 109 [2023-03-31 01:26:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:29,319 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 2834 transitions. [2023-03-31 01:26:29,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2834 transitions. [2023-03-31 01:26:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:26:29,320 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:29,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:29,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 01:26:29,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:29,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash 601566401, now seen corresponding path program 1 times [2023-03-31 01:26:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450399699] [2023-03-31 01:26:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-03-31 01:26:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:26:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-03-31 01:26:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450399699] [2023-03-31 01:26:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450399699] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:26:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483356460] [2023-03-31 01:26:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:26:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:26:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:26:29,615 INFO L87 Difference]: Start difference. First operand 2148 states and 2834 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:32,582 INFO L93 Difference]: Finished difference Result 5347 states and 7417 transitions. [2023-03-31 01:26:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-03-31 01:26:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2023-03-31 01:26:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:32,602 INFO L225 Difference]: With dead ends: 5347 [2023-03-31 01:26:32,603 INFO L226 Difference]: Without dead ends: 3588 [2023-03-31 01:26:32,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=476, Invalid=1504, Unknown=0, NotChecked=0, Total=1980 [2023-03-31 01:26:32,611 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1627 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:32,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 18 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-03-31 01:26:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2023-03-31 01:26:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 2806. [2023-03-31 01:26:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2093 states have (on average 1.2881032011466793) internal successors, (2696), 2244 states have internal predecessors, (2696), 363 states have call successors, (363), 253 states have call predecessors, (363), 349 states have return successors, (735), 414 states have call predecessors, (735), 359 states have call successors, (735) [2023-03-31 01:26:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3794 transitions. [2023-03-31 01:26:33,030 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3794 transitions. Word has length 109 [2023-03-31 01:26:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:33,031 INFO L495 AbstractCegarLoop]: Abstraction has 2806 states and 3794 transitions. [2023-03-31 01:26:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-03-31 01:26:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3794 transitions. [2023-03-31 01:26:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:26:33,034 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:33,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:33,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-31 01:26:33,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:33,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1447821441, now seen corresponding path program 1 times [2023-03-31 01:26:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149403303] [2023-03-31 01:26:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-03-31 01:26:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:26:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-31 01:26:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149403303] [2023-03-31 01:26:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149403303] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:26:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602052657] [2023-03-31 01:26:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:33,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:26:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:26:33,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:26:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-31 01:26:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:33,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2023-03-31 01:26:33,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:26:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:33,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 01:26:33,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602052657] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:33,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 01:26:33,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-03-31 01:26:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599826573] [2023-03-31 01:26:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:33,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 01:26:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 01:26:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:33,427 INFO L87 Difference]: Start difference. First operand 2806 states and 3794 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-03-31 01:26:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:34,169 INFO L93 Difference]: Finished difference Result 7749 states and 10639 transitions. [2023-03-31 01:26:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 01:26:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2023-03-31 01:26:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:34,191 INFO L225 Difference]: With dead ends: 7749 [2023-03-31 01:26:34,191 INFO L226 Difference]: Without dead ends: 3907 [2023-03-31 01:26:34,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:34,206 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 157 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:34,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:26:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2023-03-31 01:26:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3865. [2023-03-31 01:26:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 2891 states have (on average 1.280525769629886) internal successors, (3702), 3096 states have internal predecessors, (3702), 501 states have call successors, (501), 344 states have call predecessors, (501), 472 states have return successors, (1103), 573 states have call predecessors, (1103), 497 states have call successors, (1103) [2023-03-31 01:26:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 5306 transitions. [2023-03-31 01:26:34,873 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 5306 transitions. Word has length 109 [2023-03-31 01:26:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:34,877 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 5306 transitions. [2023-03-31 01:26:34,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-03-31 01:26:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 5306 transitions. [2023-03-31 01:26:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-03-31 01:26:34,880 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:34,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:34,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-03-31 01:26:35,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-03-31 01:26:35,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:35,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -963651463, now seen corresponding path program 1 times [2023-03-31 01:26:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863284997] [2023-03-31 01:26:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-03-31 01:26:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:26:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-03-31 01:26:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:26:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-03-31 01:26:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863284997] [2023-03-31 01:26:35,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863284997] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:26:35,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007421990] [2023-03-31 01:26:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:35,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:26:35,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:26:35,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:26:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-31 01:26:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:35,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 01:26:35,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:26:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-31 01:26:35,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 01:26:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007421990] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 01:26:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2023-03-31 01:26:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801502665] [2023-03-31 01:26:35,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:35,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 01:26:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 01:26:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:35,478 INFO L87 Difference]: Start difference. First operand 3865 states and 5306 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-03-31 01:26:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:36,304 INFO L93 Difference]: Finished difference Result 9933 states and 14113 transitions. [2023-03-31 01:26:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 01:26:36,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2023-03-31 01:26:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:36,340 INFO L225 Difference]: With dead ends: 9933 [2023-03-31 01:26:36,340 INFO L226 Difference]: Without dead ends: 6130 [2023-03-31 01:26:36,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:36,358 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 182 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:36,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 393 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:26:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2023-03-31 01:26:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6012. [2023-03-31 01:26:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 4504 states have (on average 1.2737566607460036) internal successors, (5737), 4825 states have internal predecessors, (5737), 799 states have call successors, (799), 524 states have call predecessors, (799), 708 states have return successors, (1924), 895 states have call predecessors, (1924), 795 states have call successors, (1924) [2023-03-31 01:26:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 8460 transitions. [2023-03-31 01:26:37,429 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 8460 transitions. Word has length 153 [2023-03-31 01:26:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:37,429 INFO L495 AbstractCegarLoop]: Abstraction has 6012 states and 8460 transitions. [2023-03-31 01:26:37,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-03-31 01:26:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 8460 transitions. [2023-03-31 01:26:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-03-31 01:26:37,441 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:37,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:37,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-31 01:26:37,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-03-31 01:26:37,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:37,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 359517991, now seen corresponding path program 1 times [2023-03-31 01:26:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:37,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688047543] [2023-03-31 01:26:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-03-31 01:26:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-03-31 01:26:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-03-31 01:26:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:26:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-03-31 01:26:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688047543] [2023-03-31 01:26:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688047543] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:37,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-03-31 01:26:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562206298] [2023-03-31 01:26:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:37,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 01:26:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 01:26:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-03-31 01:26:37,806 INFO L87 Difference]: Start difference. First operand 6012 states and 8460 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (20), 9 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-03-31 01:26:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:39,663 INFO L93 Difference]: Finished difference Result 12838 states and 18196 transitions. [2023-03-31 01:26:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 01:26:39,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (20), 9 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 155 [2023-03-31 01:26:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:39,701 INFO L225 Difference]: With dead ends: 12838 [2023-03-31 01:26:39,702 INFO L226 Difference]: Without dead ends: 6888 [2023-03-31 01:26:39,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:26:39,725 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 703 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:39,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 17 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:26:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6888 states. [2023-03-31 01:26:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6888 to 6107. [2023-03-31 01:26:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6107 states, 4579 states have (on average 1.280192181699061) internal successors, (5862), 4910 states have internal predecessors, (5862), 809 states have call successors, (809), 519 states have call predecessors, (809), 718 states have return successors, (1973), 909 states have call predecessors, (1973), 805 states have call successors, (1973) [2023-03-31 01:26:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6107 states to 6107 states and 8644 transitions. [2023-03-31 01:26:40,684 INFO L78 Accepts]: Start accepts. Automaton has 6107 states and 8644 transitions. Word has length 155 [2023-03-31 01:26:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:40,684 INFO L495 AbstractCegarLoop]: Abstraction has 6107 states and 8644 transitions. [2023-03-31 01:26:40,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (20), 9 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-03-31 01:26:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6107 states and 8644 transitions. [2023-03-31 01:26:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-03-31 01:26:40,687 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:40,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-03-31 01:26:40,687 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:40,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2147387813, now seen corresponding path program 1 times [2023-03-31 01:26:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:40,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260754676] [2023-03-31 01:26:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-03-31 01:26:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-03-31 01:26:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-03-31 01:26:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:26:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-03-31 01:26:40,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260754676] [2023-03-31 01:26:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260754676] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 01:26:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089857483] [2023-03-31 01:26:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:26:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:26:40,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 01:26:40,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-31 01:26:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:41,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 01:26:41,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 01:26:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:26:41,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 01:26:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089857483] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 01:26:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-03-31 01:26:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994421999] [2023-03-31 01:26:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:41,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 01:26:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 01:26:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:26:41,047 INFO L87 Difference]: Start difference. First operand 6107 states and 8644 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-03-31 01:26:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:42,370 INFO L93 Difference]: Finished difference Result 17233 states and 25254 transitions. [2023-03-31 01:26:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 01:26:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2023-03-31 01:26:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:42,423 INFO L225 Difference]: With dead ends: 17233 [2023-03-31 01:26:42,423 INFO L226 Difference]: Without dead ends: 11188 [2023-03-31 01:26:42,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:26:42,452 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 163 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:42,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 486 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 01:26:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2023-03-31 01:26:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 11093. [2023-03-31 01:26:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11093 states, 8377 states have (on average 1.253790139668139) internal successors, (10503), 8885 states have internal predecessors, (10503), 1424 states have call successors, (1424), 942 states have call predecessors, (1424), 1291 states have return successors, (4038), 1599 states have call predecessors, (4038), 1420 states have call successors, (4038) [2023-03-31 01:26:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11093 states to 11093 states and 15965 transitions. [2023-03-31 01:26:43,900 INFO L78 Accepts]: Start accepts. Automaton has 11093 states and 15965 transitions. Word has length 155 [2023-03-31 01:26:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:43,900 INFO L495 AbstractCegarLoop]: Abstraction has 11093 states and 15965 transitions. [2023-03-31 01:26:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-03-31 01:26:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 11093 states and 15965 transitions. [2023-03-31 01:26:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-03-31 01:26:43,906 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:43,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:43,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-31 01:26:44,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 01:26:44,118 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:44,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -379372114, now seen corresponding path program 1 times [2023-03-31 01:26:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:44,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908719502] [2023-03-31 01:26:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-03-31 01:26:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-03-31 01:26:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-03-31 01:26:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:26:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-03-31 01:26:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908719502] [2023-03-31 01:26:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908719502] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:44,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:26:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489852379] [2023-03-31 01:26:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:44,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:26:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:26:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:26:44,328 INFO L87 Difference]: Start difference. First operand 11093 states and 15965 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 6 states have call successors, (21), 9 states have call predecessors, (21), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-03-31 01:26:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:48,661 INFO L93 Difference]: Finished difference Result 33363 states and 51862 transitions. [2023-03-31 01:26:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-03-31 01:26:48,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 6 states have call successors, (21), 9 states have call predecessors, (21), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 156 [2023-03-31 01:26:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:48,770 INFO L225 Difference]: With dead ends: 33363 [2023-03-31 01:26:48,771 INFO L226 Difference]: Without dead ends: 22338 [2023-03-31 01:26:48,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:26:48,847 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1719 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:48,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 19 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-03-31 01:26:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22338 states. [2023-03-31 01:26:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22338 to 20528. [2023-03-31 01:26:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20528 states, 15523 states have (on average 1.2316562520131418) internal successors, (19119), 16384 states have internal predecessors, (19119), 2591 states have call successors, (2591), 1772 states have call predecessors, (2591), 2413 states have return successors, (6552), 2877 states have call predecessors, (6552), 2587 states have call successors, (6552) [2023-03-31 01:26:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20528 states to 20528 states and 28262 transitions. [2023-03-31 01:26:51,699 INFO L78 Accepts]: Start accepts. Automaton has 20528 states and 28262 transitions. Word has length 156 [2023-03-31 01:26:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:51,699 INFO L495 AbstractCegarLoop]: Abstraction has 20528 states and 28262 transitions. [2023-03-31 01:26:51,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 6 states have call successors, (21), 9 states have call predecessors, (21), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-03-31 01:26:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 20528 states and 28262 transitions. [2023-03-31 01:26:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-03-31 01:26:51,713 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:51,713 INFO L195 NwaCegarLoop]: 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:51,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-03-31 01:26:51,713 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:51,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash -122755668, now seen corresponding path program 1 times [2023-03-31 01:26:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755890613] [2023-03-31 01:26:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:26:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-03-31 01:26:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-03-31 01:26:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-03-31 01:26:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:26:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-03-31 01:26:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-03-31 01:26:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-03-31 01:26:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-03-31 01:26:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:26:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-03-31 01:26:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:26:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-03-31 01:26:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-03-31 01:26:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:26:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:26:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:26:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-03-31 01:26:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-03-31 01:26:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:26:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-03-31 01:26:51,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:26:51,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755890613] [2023-03-31 01:26:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755890613] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:26:51,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:26:51,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:26:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339484288] [2023-03-31 01:26:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:26:51,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:26:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:26:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:26:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:26:51,927 INFO L87 Difference]: Start difference. First operand 20528 states and 28262 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 4 states have internal predecessors, (112), 5 states have call successors, (25), 9 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-03-31 01:26:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:26:55,429 INFO L93 Difference]: Finished difference Result 35713 states and 50288 transitions. [2023-03-31 01:26:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-03-31 01:26:55,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 4 states have internal predecessors, (112), 5 states have call successors, (25), 9 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 207 [2023-03-31 01:26:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:26:55,500 INFO L225 Difference]: With dead ends: 35713 [2023-03-31 01:26:55,501 INFO L226 Difference]: Without dead ends: 15287 [2023-03-31 01:26:55,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2023-03-31 01:26:55,595 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:26:55,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 17 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:26:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15287 states. [2023-03-31 01:26:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15287 to 14289. [2023-03-31 01:26:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14289 states, 10634 states have (on average 1.1913673123942072) internal successors, (12669), 11268 states have internal predecessors, (12669), 1870 states have call successors, (1870), 1306 states have call predecessors, (1870), 1784 states have return successors, (3441), 2025 states have call predecessors, (3441), 1866 states have call successors, (3441) [2023-03-31 01:26:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14289 states to 14289 states and 17980 transitions. [2023-03-31 01:26:57,692 INFO L78 Accepts]: Start accepts. Automaton has 14289 states and 17980 transitions. Word has length 207 [2023-03-31 01:26:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:26:57,693 INFO L495 AbstractCegarLoop]: Abstraction has 14289 states and 17980 transitions. [2023-03-31 01:26:57,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 4 states have internal predecessors, (112), 5 states have call successors, (25), 9 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-03-31 01:26:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 14289 states and 17980 transitions. [2023-03-31 01:26:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-03-31 01:26:57,703 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:26:57,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:57,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-03-31 01:26:57,703 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:26:57,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:26:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 475056837, now seen corresponding path program 1 times [2023-03-31 01:26:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:26:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847589508] [2023-03-31 01:26:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:26:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:26:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 01:26:57,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-31 01:26:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 01:26:57,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-03-31 01:26:57,805 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-31 01:26:57,806 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-31 01:26:57,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-03-31 01:26:57,813 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:26:57,818 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 01:26:57,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 01:26:57 BoogieIcfgContainer [2023-03-31 01:26:57,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 01:26:57,958 INFO L158 Benchmark]: Toolchain (without parser) took 46845.31ms. Allocated memory was 278.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 227.3MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 431.4MB. Max. memory is 8.0GB. [2023-03-31 01:26:57,958 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 01:26:57,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.70ms. Allocated memory is still 278.9MB. Free memory was 226.7MB in the beginning and 213.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-03-31 01:26:57,959 INFO L158 Benchmark]: Boogie Preprocessor took 40.88ms. Allocated memory is still 278.9MB. Free memory was 213.6MB in the beginning and 211.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-31 01:26:57,959 INFO L158 Benchmark]: RCFGBuilder took 592.14ms. Allocated memory is still 278.9MB. Free memory was 211.0MB in the beginning and 189.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-03-31 01:26:57,959 INFO L158 Benchmark]: TraceAbstraction took 45954.94ms. Allocated memory was 278.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 189.0MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 392.6MB. Max. memory is 8.0GB. [2023-03-31 01:26:57,963 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.70ms. Allocated memory is still 278.9MB. Free memory was 226.7MB in the beginning and 213.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.88ms. Allocated memory is still 278.9MB. Free memory was 213.6MB in the beginning and 211.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 592.14ms. Allocated memory is still 278.9MB. Free memory was 211.0MB in the beginning and 189.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 45954.94ms. Allocated memory was 278.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 189.0MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 392.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=62, \old(E_2)=50, \old(M_E)=58, \old(T1_E)=57, \old(T2_E)=49, \old(m_i)=53, \old(m_pc)=63, \old(m_st)=64, \old(t1_i)=51, \old(t1_pc)=60, \old(t1_st)=54, \old(t2_i)=59, \old(t2_pc)=55, \old(t2_st)=52, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L577] CALL init_model() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L578] CALL start_simulation() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] CALL, EXPR is_master_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_master_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_transmit1_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_transmit2_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L532] CALL eval() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L301] CALL transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L315] CALL transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L287] CALL master() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] CALL, EXPR is_master_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_master_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit1_triggered()=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit2_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L301] CALL transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] CALL, EXPR is_master_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_master_triggered()=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit1_triggered()=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit2_triggered()=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L315] CALL transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 172 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15515 SdHoareTripleChecker+Valid, 14.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15345 mSDsluCounter, 1729 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 781 mSDsCounter, 5746 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18020 IncrementalHoareTripleChecker+Invalid, 23766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5746 mSolverCounterUnsat, 948 mSDtfsCounter, 18020 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1235 GetRequests, 933 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20528occurred in iteration=15, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 6266 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2517 NumberOfCodeBlocks, 2517 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2290 ConstructedInterpolants, 0 QuantifiedInterpolants, 5184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1863 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 430/458 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 incorrect! [2023-03-31 01:26:57,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...