/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:41:45,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:41:45,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:41:45,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:41:45,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:41:45,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:41:45,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:41:45,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:41:45,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:41:45,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:41:45,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:41:45,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:41:45,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:41:45,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:41:45,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:41:45,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:41:45,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:41:45,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:41:45,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:41:45,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:41:45,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:41:45,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:41:45,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:41:45,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:41:45,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:41:45,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:41:45,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:41:45,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:41:45,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:41:45,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:41:45,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:41:45,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:41:45,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:41:45,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:41:45,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:41:45,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:41:45,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:41:45,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:41:45,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:41:45,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:41:45,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:41:45,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:41:45,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:41:45,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:41:45,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:41:45,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:41:45,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:41:45,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:41:45,911 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:41:45,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:41:45,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:41:45,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:41:45,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:41:45,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:41:45,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:41:45,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:41:45,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:41:45,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:41:45,914 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:41:45,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 22:41:46,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:41:46,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:41:46,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:41:46,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:41:46,101 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:41:46,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2022-01-18 22:41:46,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72a2c9a9/1fd512dab0af484a920e5cdd6faeb3ef/FLAG199d955cb [2022-01-18 22:41:46,518 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:41:46,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2022-01-18 22:41:46,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72a2c9a9/1fd512dab0af484a920e5cdd6faeb3ef/FLAG199d955cb [2022-01-18 22:41:46,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72a2c9a9/1fd512dab0af484a920e5cdd6faeb3ef [2022-01-18 22:41:46,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:41:46,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:41:46,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:41:46,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:41:46,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:41:46,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:41:46" (1/1) ... [2022-01-18 22:41:46,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131d3e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:46, skipping insertion in model container [2022-01-18 22:41:46,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:41:46" (1/1) ... [2022-01-18 22:41:46,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:41:46,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:41:47,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i[944,957] [2022-01-18 22:41:47,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:41:47,329 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:41:47,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i[944,957] [2022-01-18 22:41:47,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:41:47,412 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:41:47,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47 WrapperNode [2022-01-18 22:41:47,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:41:47,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:41:47,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:41:47,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:41:47,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,471 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2022-01-18 22:41:47,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:41:47,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:41:47,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:41:47,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:41:47,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:41:47,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:41:47,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:41:47,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:41:47,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (1/1) ... [2022-01-18 22:41:47,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:41:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:41:47,537 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) [2022-01-18 22:41:47,544 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 [2022-01-18 22:41:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:41:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:41:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:41:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:41:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:41:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:41:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:41:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:41:47,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:41:47,590 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:41:47,692 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:41:47,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:41:48,072 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:41:48,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:41:48,313 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:41:48,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:41:48 BoogieIcfgContainer [2022-01-18 22:41:48,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:41:48,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:41:48,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:41:48,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:41:48,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:41:46" (1/3) ... [2022-01-18 22:41:48,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bd7bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:41:48, skipping insertion in model container [2022-01-18 22:41:48,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:47" (2/3) ... [2022-01-18 22:41:48,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bd7bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:41:48, skipping insertion in model container [2022-01-18 22:41:48,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:41:48" (3/3) ... [2022-01-18 22:41:48,320 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2022-01-18 22:41:48,324 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:41:48,324 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:41:48,324 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:41:48,362 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,362 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,362 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,362 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,362 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,363 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,363 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,363 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,363 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,363 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,363 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,364 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,364 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,364 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,365 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,366 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,367 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,373 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,377 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,377 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,377 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,377 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,378 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,379 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,381 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,382 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,382 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,382 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,382 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,382 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,383 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,384 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,385 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,385 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,385 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,385 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,385 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,386 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,386 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,386 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,391 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,391 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,391 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,391 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,392 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,392 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:48,396 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:41:48,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:41:48,446 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:41:48,446 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:41:48,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-01-18 22:41:48,497 INFO L129 PetriNetUnfolder]: 2/119 cut-off events. [2022-01-18 22:41:48,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:41:48,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-01-18 22:41:48,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-01-18 22:41:48,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-01-18 22:41:48,524 INFO L129 PetriNetUnfolder]: 0/80 cut-off events. [2022-01-18 22:41:48,524 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:41:48,525 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:48,525 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-18 22:41:48,526 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -263811097, now seen corresponding path program 1 times [2022-01-18 22:41:48,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:48,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928071250] [2022-01-18 22:41:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:48,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:48,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928071250] [2022-01-18 22:41:48,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928071250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:48,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:48,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:41:48,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289340945] [2022-01-18 22:41:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:48,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:41:48,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:48,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:41:48,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:41:48,833 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 122 [2022-01-18 22:41:48,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:48,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:48,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 122 [2022-01-18 22:41:48,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:48,922 INFO L129 PetriNetUnfolder]: 10/157 cut-off events. [2022-01-18 22:41:48,922 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-18 22:41:48,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 157 events. 10/157 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 285 event pairs, 2 based on Foata normal form. 7/158 useless extension candidates. Maximal degree in co-relation 139. Up to 17 conditions per place. [2022-01-18 22:41:48,924 INFO L132 encePairwiseOnDemand]: 117/122 looper letters, 8 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-01-18 22:41:48,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 263 flow [2022-01-18 22:41:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:41:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:41:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2022-01-18 22:41:48,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9426229508196722 [2022-01-18 22:41:48,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2022-01-18 22:41:48,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2022-01-18 22:41:48,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:48,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2022-01-18 22:41:48,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:48,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:48,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:48,944 INFO L186 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 345 transitions. [2022-01-18 22:41:48,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 263 flow [2022-01-18 22:41:48,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:41:48,948 INFO L242 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2022-01-18 22:41:48,950 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2022-01-18 22:41:48,952 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-01-18 22:41:48,952 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2022-01-18 22:41:48,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:48,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:48,953 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-18 22:41:48,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:41:48,953 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 437545192, now seen corresponding path program 1 times [2022-01-18 22:41:48,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:48,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824914378] [2022-01-18 22:41:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:48,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:49,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824914378] [2022-01-18 22:41:49,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824914378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:49,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:49,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:49,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921825777] [2022-01-18 22:41:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:49,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:49,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:49,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:49,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:49,200 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2022-01-18 22:41:49,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:49,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:49,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2022-01-18 22:41:49,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:49,663 INFO L129 PetriNetUnfolder]: 588/1730 cut-off events. [2022-01-18 22:41:49,663 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-01-18 22:41:49,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 1730 events. 588/1730 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12722 event pairs, 79 based on Foata normal form. 0/1687 useless extension candidates. Maximal degree in co-relation 2689. Up to 460 conditions per place. [2022-01-18 22:41:49,672 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 27 selfloop transitions, 2 changer transitions 57/167 dead transitions. [2022-01-18 22:41:49,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 167 transitions, 510 flow [2022-01-18 22:41:49,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:41:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:41:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2022-01-18 22:41:49,675 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.848816029143898 [2022-01-18 22:41:49,675 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2022-01-18 22:41:49,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2022-01-18 22:41:49,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:49,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2022-01-18 22:41:49,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.55555555555556) internal successors, (932), 9 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:49,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:49,680 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:49,680 INFO L186 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 9 states and 932 transitions. [2022-01-18 22:41:49,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 167 transitions, 510 flow [2022-01-18 22:41:49,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 167 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:41:49,683 INFO L242 Difference]: Finished difference. Result has 137 places, 103 transitions, 232 flow [2022-01-18 22:41:49,683 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2022-01-18 22:41:49,684 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2022-01-18 22:41:49,684 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 232 flow [2022-01-18 22:41:49,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:49,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:49,684 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-18 22:41:49,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:41:49,685 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1274220826, now seen corresponding path program 1 times [2022-01-18 22:41:49,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116398849] [2022-01-18 22:41:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:49,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:49,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116398849] [2022-01-18 22:41:49,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116398849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:49,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:49,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:49,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864044222] [2022-01-18 22:41:49,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:49,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:49,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:49,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:49,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:49,782 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2022-01-18 22:41:49,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:49,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:49,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2022-01-18 22:41:49,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:50,025 INFO L129 PetriNetUnfolder]: 329/777 cut-off events. [2022-01-18 22:41:50,025 INFO L130 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-01-18 22:41:50,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 777 events. 329/777 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4004 event pairs, 89 based on Foata normal form. 20/773 useless extension candidates. Maximal degree in co-relation 1497. Up to 259 conditions per place. [2022-01-18 22:41:50,030 INFO L132 encePairwiseOnDemand]: 114/122 looper letters, 22 selfloop transitions, 4 changer transitions 31/138 dead transitions. [2022-01-18 22:41:50,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 437 flow [2022-01-18 22:41:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:41:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:41:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1009 transitions. [2022-01-18 22:41:50,033 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8270491803278689 [2022-01-18 22:41:50,033 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1009 transitions. [2022-01-18 22:41:50,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1009 transitions. [2022-01-18 22:41:50,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:50,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1009 transitions. [2022-01-18 22:41:50,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,037 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,037 INFO L186 Difference]: Start difference. First operand has 137 places, 103 transitions, 232 flow. Second operand 10 states and 1009 transitions. [2022-01-18 22:41:50,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 437 flow [2022-01-18 22:41:50,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 403 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-18 22:41:50,042 INFO L242 Difference]: Finished difference. Result has 127 places, 103 transitions, 240 flow [2022-01-18 22:41:50,042 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=240, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2022-01-18 22:41:50,043 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-01-18 22:41:50,043 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 240 flow [2022-01-18 22:41:50,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,044 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:50,044 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-18 22:41:50,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:41:50,044 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1082348125, now seen corresponding path program 1 times [2022-01-18 22:41:50,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:50,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41439047] [2022-01-18 22:41:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:50,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:50,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:50,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41439047] [2022-01-18 22:41:50,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41439047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:50,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:50,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:41:50,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541319799] [2022-01-18 22:41:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:50,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:41:50,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:41:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:41:50,126 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-01-18 22:41:50,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:50,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-01-18 22:41:50,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:50,374 INFO L129 PetriNetUnfolder]: 439/1028 cut-off events. [2022-01-18 22:41:50,375 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-01-18 22:41:50,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 1028 events. 439/1028 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6358 event pairs, 12 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1831. Up to 277 conditions per place. [2022-01-18 22:41:50,380 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 25 selfloop transitions, 6 changer transitions 40/156 dead transitions. [2022-01-18 22:41:50,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 156 transitions, 492 flow [2022-01-18 22:41:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:41:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:41:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1073 transitions. [2022-01-18 22:41:50,383 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8795081967213115 [2022-01-18 22:41:50,383 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1073 transitions. [2022-01-18 22:41:50,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1073 transitions. [2022-01-18 22:41:50,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:50,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1073 transitions. [2022-01-18 22:41:50,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,387 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,387 INFO L186 Difference]: Start difference. First operand has 127 places, 103 transitions, 240 flow. Second operand 10 states and 1073 transitions. [2022-01-18 22:41:50,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 156 transitions, 492 flow [2022-01-18 22:41:50,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 156 transitions, 472 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-01-18 22:41:50,391 INFO L242 Difference]: Finished difference. Result has 127 places, 105 transitions, 274 flow [2022-01-18 22:41:50,391 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2022-01-18 22:41:50,392 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-01-18 22:41:50,393 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 274 flow [2022-01-18 22:41:50,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,394 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:50,394 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-18 22:41:50,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:41:50,394 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash 699946214, now seen corresponding path program 1 times [2022-01-18 22:41:50,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:50,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437857313] [2022-01-18 22:41:50,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:50,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:50,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:50,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437857313] [2022-01-18 22:41:50,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437857313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:50,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:50,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:50,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661389538] [2022-01-18 22:41:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:50,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:50,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:50,534 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-01-18 22:41:50,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:50,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-01-18 22:41:50,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:50,704 INFO L129 PetriNetUnfolder]: 172/536 cut-off events. [2022-01-18 22:41:50,705 INFO L130 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2022-01-18 22:41:50,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 536 events. 172/536 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2748 event pairs, 13 based on Foata normal form. 18/551 useless extension candidates. Maximal degree in co-relation 1304. Up to 136 conditions per place. [2022-01-18 22:41:50,707 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 29 selfloop transitions, 9 changer transitions 31/154 dead transitions. [2022-01-18 22:41:50,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 154 transitions, 643 flow [2022-01-18 22:41:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:41:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:41:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1071 transitions. [2022-01-18 22:41:50,709 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8778688524590164 [2022-01-18 22:41:50,709 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1071 transitions. [2022-01-18 22:41:50,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1071 transitions. [2022-01-18 22:41:50,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:50,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1071 transitions. [2022-01-18 22:41:50,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,713 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,713 INFO L186 Difference]: Start difference. First operand has 127 places, 105 transitions, 274 flow. Second operand 10 states and 1071 transitions. [2022-01-18 22:41:50,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 154 transitions, 643 flow [2022-01-18 22:41:50,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 154 transitions, 619 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-18 22:41:50,716 INFO L242 Difference]: Finished difference. Result has 131 places, 108 transitions, 342 flow [2022-01-18 22:41:50,716 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=131, PETRI_TRANSITIONS=108} [2022-01-18 22:41:50,717 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2022-01-18 22:41:50,717 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 108 transitions, 342 flow [2022-01-18 22:41:50,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,717 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:50,717 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:41:50,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:41:50,718 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash 729460545, now seen corresponding path program 1 times [2022-01-18 22:41:50,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:50,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937247503] [2022-01-18 22:41:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:50,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:50,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:50,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937247503] [2022-01-18 22:41:50,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937247503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:50,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:50,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:41:50,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284901960] [2022-01-18 22:41:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:50,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:41:50,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:50,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:41:50,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:41:50,836 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2022-01-18 22:41:50,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 108 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:50,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:50,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2022-01-18 22:41:50,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:50,992 INFO L129 PetriNetUnfolder]: 49/342 cut-off events. [2022-01-18 22:41:50,992 INFO L130 PetriNetUnfolder]: For 605/648 co-relation queries the response was YES. [2022-01-18 22:41:50,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 342 events. 49/342 cut-off events. For 605/648 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1452 event pairs, 13 based on Foata normal form. 7/344 useless extension candidates. Maximal degree in co-relation 783. Up to 60 conditions per place. [2022-01-18 22:41:50,994 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 29 selfloop transitions, 6 changer transitions 5/128 dead transitions. [2022-01-18 22:41:50,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 128 transitions, 474 flow [2022-01-18 22:41:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:41:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:41:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1011 transitions. [2022-01-18 22:41:50,998 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.828688524590164 [2022-01-18 22:41:50,998 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1011 transitions. [2022-01-18 22:41:50,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1011 transitions. [2022-01-18 22:41:50,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:50,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1011 transitions. [2022-01-18 22:41:50,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,001 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,001 INFO L186 Difference]: Start difference. First operand has 131 places, 108 transitions, 342 flow. Second operand 10 states and 1011 transitions. [2022-01-18 22:41:51,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 128 transitions, 474 flow [2022-01-18 22:41:51,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 128 transitions, 418 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-01-18 22:41:51,004 INFO L242 Difference]: Finished difference. Result has 133 places, 112 transitions, 326 flow [2022-01-18 22:41:51,004 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=326, PETRI_PLACES=133, PETRI_TRANSITIONS=112} [2022-01-18 22:41:51,005 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 6 predicate places. [2022-01-18 22:41:51,005 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 112 transitions, 326 flow [2022-01-18 22:41:51,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,006 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:51,006 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:41:51,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:41:51,006 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:51,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1076665217, now seen corresponding path program 2 times [2022-01-18 22:41:51,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:51,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668692563] [2022-01-18 22:41:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:51,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:51,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:51,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668692563] [2022-01-18 22:41:51,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668692563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:51,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:51,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:41:51,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290964499] [2022-01-18 22:41:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:51,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:41:51,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:41:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:41:51,097 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-01-18 22:41:51,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 112 transitions, 326 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:51,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-01-18 22:41:51,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:51,244 INFO L129 PetriNetUnfolder]: 69/332 cut-off events. [2022-01-18 22:41:51,245 INFO L130 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-01-18 22:41:51,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 332 events. 69/332 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1429 event pairs, 2 based on Foata normal form. 11/342 useless extension candidates. Maximal degree in co-relation 814. Up to 64 conditions per place. [2022-01-18 22:41:51,246 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 19 selfloop transitions, 12 changer transitions 22/138 dead transitions. [2022-01-18 22:41:51,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 138 transitions, 586 flow [2022-01-18 22:41:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:41:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:41:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1153 transitions. [2022-01-18 22:41:51,249 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8591654247391952 [2022-01-18 22:41:51,249 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1153 transitions. [2022-01-18 22:41:51,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1153 transitions. [2022-01-18 22:41:51,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:51,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1153 transitions. [2022-01-18 22:41:51,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 104.81818181818181) internal successors, (1153), 11 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,253 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,253 INFO L186 Difference]: Start difference. First operand has 133 places, 112 transitions, 326 flow. Second operand 11 states and 1153 transitions. [2022-01-18 22:41:51,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 138 transitions, 586 flow [2022-01-18 22:41:51,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 138 transitions, 524 flow, removed 15 selfloop flow, removed 10 redundant places. [2022-01-18 22:41:51,256 INFO L242 Difference]: Finished difference. Result has 135 places, 108 transitions, 324 flow [2022-01-18 22:41:51,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=135, PETRI_TRANSITIONS=108} [2022-01-18 22:41:51,256 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 8 predicate places. [2022-01-18 22:41:51,256 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 108 transitions, 324 flow [2022-01-18 22:41:51,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,257 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:51,257 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:41:51,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:41:51,257 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash -955289347, now seen corresponding path program 1 times [2022-01-18 22:41:51,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:51,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054943788] [2022-01-18 22:41:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:51,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:51,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054943788] [2022-01-18 22:41:51,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054943788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:51,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:51,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:51,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92357026] [2022-01-18 22:41:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:51,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:51,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:51,364 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-01-18 22:41:51,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 108 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:51,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-01-18 22:41:51,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:51,458 INFO L129 PetriNetUnfolder]: 38/289 cut-off events. [2022-01-18 22:41:51,458 INFO L130 PetriNetUnfolder]: For 186/196 co-relation queries the response was YES. [2022-01-18 22:41:51,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 289 events. 38/289 cut-off events. For 186/196 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1049 event pairs, 4 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 541. Up to 32 conditions per place. [2022-01-18 22:41:51,459 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 18 selfloop transitions, 1 changer transitions 11/121 dead transitions. [2022-01-18 22:41:51,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 121 transitions, 422 flow [2022-01-18 22:41:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:41:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:41:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 731 transitions. [2022-01-18 22:41:51,461 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8559718969555035 [2022-01-18 22:41:51,461 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 731 transitions. [2022-01-18 22:41:51,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 731 transitions. [2022-01-18 22:41:51,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:51,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 731 transitions. [2022-01-18 22:41:51,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,464 INFO L186 Difference]: Start difference. First operand has 135 places, 108 transitions, 324 flow. Second operand 7 states and 731 transitions. [2022-01-18 22:41:51,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 121 transitions, 422 flow [2022-01-18 22:41:51,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 341 flow, removed 19 selfloop flow, removed 16 redundant places. [2022-01-18 22:41:51,466 INFO L242 Difference]: Finished difference. Result has 125 places, 108 transitions, 259 flow [2022-01-18 22:41:51,466 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=125, PETRI_TRANSITIONS=108} [2022-01-18 22:41:51,466 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -2 predicate places. [2022-01-18 22:41:51,466 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 259 flow [2022-01-18 22:41:51,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,467 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:51,467 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:41:51,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:41:51,467 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1930955929, now seen corresponding path program 2 times [2022-01-18 22:41:51,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:51,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588028329] [2022-01-18 22:41:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:51,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:51,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:51,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588028329] [2022-01-18 22:41:51,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588028329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:51,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:51,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:51,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211578754] [2022-01-18 22:41:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:51,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:51,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:51,577 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-01-18 22:41:51,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:51,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-01-18 22:41:51,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:51,678 INFO L129 PetriNetUnfolder]: 34/293 cut-off events. [2022-01-18 22:41:51,678 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-01-18 22:41:51,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 293 events. 34/293 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1091 event pairs, 7 based on Foata normal form. 1/285 useless extension candidates. Maximal degree in co-relation 452. Up to 35 conditions per place. [2022-01-18 22:41:51,679 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 16 selfloop transitions, 1 changer transitions 13/121 dead transitions. [2022-01-18 22:41:51,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 362 flow [2022-01-18 22:41:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:41:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:41:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 731 transitions. [2022-01-18 22:41:51,680 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8559718969555035 [2022-01-18 22:41:51,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 731 transitions. [2022-01-18 22:41:51,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 731 transitions. [2022-01-18 22:41:51,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:51,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 731 transitions. [2022-01-18 22:41:51,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,683 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,683 INFO L186 Difference]: Start difference. First operand has 125 places, 108 transitions, 259 flow. Second operand 7 states and 731 transitions. [2022-01-18 22:41:51,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 362 flow [2022-01-18 22:41:51,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 121 transitions, 347 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-18 22:41:51,685 INFO L242 Difference]: Finished difference. Result has 127 places, 108 transitions, 263 flow [2022-01-18 22:41:51,685 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=127, PETRI_TRANSITIONS=108} [2022-01-18 22:41:51,686 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-01-18 22:41:51,686 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 108 transitions, 263 flow [2022-01-18 22:41:51,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:51,686 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:51,686 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:41:51,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:41:51,686 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1080649817, now seen corresponding path program 3 times [2022-01-18 22:41:51,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:51,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795446407] [2022-01-18 22:41:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:51,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:41:51,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:41:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:41:51,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:41:51,840 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:41:51,841 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:41:51,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:41:51,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:41:51,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:41:51,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:41:51,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:41:51,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:41:51,848 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-01-18 22:41:51,851 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:41:51,852 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:41:51,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:41:51 BasicIcfg [2022-01-18 22:41:51,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:41:51,960 INFO L158 Benchmark]: Toolchain (without parser) took 5038.16ms. Allocated memory was 415.2MB in the beginning and 694.2MB in the end (delta: 278.9MB). Free memory was 356.8MB in the beginning and 604.3MB in the end (delta: -247.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. [2022-01-18 22:41:51,960 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 415.2MB. Free memory is still 374.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:41:51,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.67ms. Allocated memory was 415.2MB in the beginning and 694.2MB in the end (delta: 278.9MB). Free memory was 356.5MB in the beginning and 651.6MB in the end (delta: -295.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-18 22:41:51,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.76ms. Allocated memory is still 694.2MB. Free memory was 651.6MB in the beginning and 648.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:41:51,963 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 694.2MB. Free memory was 648.5MB in the beginning and 646.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:41:51,963 INFO L158 Benchmark]: RCFGBuilder took 808.82ms. Allocated memory is still 694.2MB. Free memory was 646.4MB in the beginning and 582.4MB in the end (delta: 64.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.0GB. [2022-01-18 22:41:51,963 INFO L158 Benchmark]: TraceAbstraction took 3643.81ms. Allocated memory is still 694.2MB. Free memory was 581.4MB in the beginning and 604.3MB in the end (delta: -22.9MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:41:51,965 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.14ms. Allocated memory is still 415.2MB. Free memory is still 374.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 488.67ms. Allocated memory was 415.2MB in the beginning and 694.2MB in the end (delta: 278.9MB). Free memory was 356.5MB in the beginning and 651.6MB in the end (delta: -295.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.76ms. Allocated memory is still 694.2MB. Free memory was 651.6MB in the beginning and 648.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 694.2MB. Free memory was 648.5MB in the beginning and 646.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 808.82ms. Allocated memory is still 694.2MB. Free memory was 646.4MB in the beginning and 582.4MB in the end (delta: 64.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.0GB. * TraceAbstraction took 3643.81ms. Allocated memory is still 694.2MB. Free memory was 581.4MB in the beginning and 604.3MB in the end (delta: -22.9MB). There was no memory consumed. Max. memory is 16.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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L723] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L724] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L725] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L727] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L729] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L731] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L732] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L733] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L734] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L735] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L736] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L737] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L743] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L744] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L745] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L746] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L747] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t852; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t852, ((void *)0), P0, ((void *)0))=-2, t852={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t853; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t853, ((void *)0), P1, ((void *)0))=-1, t852={5:0}, t853={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t854; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t854, ((void *)0), P2, ((void *)0))=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 687 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 846 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 100 mSDtfsCounter, 846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=5, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 769 ConstructedInterpolants, 0 QuantifiedInterpolants, 3122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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! [2022-01-18 22:41:51,993 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...