/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/rfi007_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:49:06,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:49:06,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:49:06,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:49:06,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:49:06,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:49:06,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:49:06,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:49:06,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:49:06,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:49:06,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:49:06,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:49:06,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:49:06,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:49:06,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:49:06,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:49:06,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:49:06,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:49:06,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:49:06,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:49:06,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:49:06,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:49:06,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:49:06,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:49:06,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:49:06,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:49:06,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:49:06,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:49:06,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:49:06,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:49:06,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:49:06,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:49:06,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:49:06,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:49:06,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:49:06,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:49:06,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:49:06,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:49:06,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:49:06,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:49:06,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:49:06,129 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:49:06,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:49:06,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:49:06,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:49:06,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:49:06,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:49:06,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:49:06,159 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:49:06,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:49:06,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:49:06,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:49:06,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:49:06,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:49:06,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:49:06,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:49:06,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:49:06,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:49:06,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:49:06,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:49:06,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:49:06,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:49:06,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:49:06,162 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:49:06,162 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:49:06,162 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:49:06,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:49:06,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:49:06,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:49:06,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:49:06,401 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:49:06,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2022-01-18 22:49:06,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320e1a1ac/f8a40e556f764a6599ee29caa8d65f52/FLAG1296f8150 [2022-01-18 22:49:06,894 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:49:06,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2022-01-18 22:49:06,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320e1a1ac/f8a40e556f764a6599ee29caa8d65f52/FLAG1296f8150 [2022-01-18 22:49:07,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320e1a1ac/f8a40e556f764a6599ee29caa8d65f52 [2022-01-18 22:49:07,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:49:07,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:49:07,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:49:07,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:49:07,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:49:07,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cbf6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07, skipping insertion in model container [2022-01-18 22:49:07,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:49:07,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:49:07,425 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/rfi007_tso.i[944,957] [2022-01-18 22:49:07,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:49:07,633 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:49:07,644 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/rfi007_tso.i[944,957] [2022-01-18 22:49:07,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:49:07,746 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:49:07,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07 WrapperNode [2022-01-18 22:49:07,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:49:07,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:49:07,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:49:07,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:49:07,754 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:49:07" (1/1) ... [2022-01-18 22:49:07,782 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:49:07" (1/1) ... [2022-01-18 22:49:07,826 INFO L137 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 362 [2022-01-18 22:49:07,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:49:07,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:49:07,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:49:07,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:49:07,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:49:07,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:49:07,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:49:07,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:49:07,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (1/1) ... [2022-01-18 22:49:07,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:49:07,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:49:07,920 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:49:07,947 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:49:07,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:49:07,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:49:07,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:49:07,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:49:07,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:49:07,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:49:07,965 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:49:08,098 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:49:08,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:49:08,563 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:49:08,856 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:49:08,856 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:49:08,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:49:08 BoogieIcfgContainer [2022-01-18 22:49:08,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:49:08,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:49:08,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:49:08,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:49:08,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:49:07" (1/3) ... [2022-01-18 22:49:08,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb4899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:49:08, skipping insertion in model container [2022-01-18 22:49:08,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:49:07" (2/3) ... [2022-01-18 22:49:08,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb4899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:49:08, skipping insertion in model container [2022-01-18 22:49:08,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:49:08" (3/3) ... [2022-01-18 22:49:08,865 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2022-01-18 22:49:08,869 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:49:08,870 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:49:08,870 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:49:08,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,914 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,914 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,917 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,931 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,931 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,932 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,932 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,933 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,935 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,939 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,939 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,939 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,939 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,942 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,944 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,945 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,946 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,947 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,949 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,949 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,950 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,951 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,952 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,953 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,954 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,956 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,957 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,957 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,957 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:49:08,957 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:49:09,007 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:49:09,014 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:49:09,014 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 22:49:09,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-01-18 22:49:09,064 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2022-01-18 22:49:09,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:49:09,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-01-18 22:49:09,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-01-18 22:49:09,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-01-18 22:49:09,090 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2022-01-18 22:49:09,090 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:49:09,090 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:09,091 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] [2022-01-18 22:49:09,092 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1194478354, now seen corresponding path program 1 times [2022-01-18 22:49:09,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:09,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625919079] [2022-01-18 22:49:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:09,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:09,394 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:49:09,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:09,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625919079] [2022-01-18 22:49:09,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625919079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:09,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:09,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:49:09,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340770846] [2022-01-18 22:49:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:09,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:49:09,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:49:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:49:09,443 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2022-01-18 22:49:09,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:49:09,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:09,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2022-01-18 22:49:09,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:09,557 INFO L129 PetriNetUnfolder]: 24/174 cut-off events. [2022-01-18 22:49:09,559 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-18 22:49:09,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 174 events. 24/174 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 489 event pairs, 3 based on Foata normal form. 7/171 useless extension candidates. Maximal degree in co-relation 187. Up to 40 conditions per place. [2022-01-18 22:49:09,564 INFO L132 encePairwiseOnDemand]: 91/96 looper letters, 10 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2022-01-18 22:49:09,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 216 flow [2022-01-18 22:49:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:49:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:49:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2022-01-18 22:49:09,577 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236111111111112 [2022-01-18 22:49:09,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2022-01-18 22:49:09,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2022-01-18 22:49:09,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:09,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2022-01-18 22:49:09,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:49:09,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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:49:09,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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:49:09,593 INFO L186 Difference]: Start difference. First operand has 99 places, 94 transitions, 194 flow. Second operand 3 states and 266 transitions. [2022-01-18 22:49:09,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 216 flow [2022-01-18 22:49:09,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:49:09,604 INFO L242 Difference]: Finished difference. Result has 97 places, 90 transitions, 188 flow [2022-01-18 22:49:09,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2022-01-18 22:49:09,610 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2022-01-18 22:49:09,610 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 188 flow [2022-01-18 22:49:09,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:49:09,611 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:09,611 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:49:09,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:49:09,612 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1130294467, now seen corresponding path program 1 times [2022-01-18 22:49:09,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:09,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26031707] [2022-01-18 22:49:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:09,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:09,874 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:49:09,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:09,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26031707] [2022-01-18 22:49:09,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26031707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:09,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:09,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:49:09,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564550539] [2022-01-18 22:49:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:09,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:49:09,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:09,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:49:09,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:49:09,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 96 [2022-01-18 22:49:09,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:49:09,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:09,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 96 [2022-01-18 22:49:09,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:10,151 INFO L129 PetriNetUnfolder]: 84/377 cut-off events. [2022-01-18 22:49:10,151 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-01-18 22:49:10,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 377 events. 84/377 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1876 event pairs, 18 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 520. Up to 65 conditions per place. [2022-01-18 22:49:10,156 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 14 selfloop transitions, 2 changer transitions 34/116 dead transitions. [2022-01-18 22:49:10,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 328 flow [2022-01-18 22:49:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:49:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:49:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 736 transitions. [2022-01-18 22:49:10,161 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2022-01-18 22:49:10,162 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 736 transitions. [2022-01-18 22:49:10,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 736 transitions. [2022-01-18 22:49:10,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:10,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 736 transitions. [2022-01-18 22:49:10,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.77777777777777) internal successors, (736), 9 states have internal predecessors, (736), 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:49:10,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:10,170 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:10,170 INFO L186 Difference]: Start difference. First operand has 97 places, 90 transitions, 188 flow. Second operand 9 states and 736 transitions. [2022-01-18 22:49:10,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 328 flow [2022-01-18 22:49:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 116 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:49:10,174 INFO L242 Difference]: Finished difference. Result has 110 places, 80 transitions, 184 flow [2022-01-18 22:49:10,174 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=110, PETRI_TRANSITIONS=80} [2022-01-18 22:49:10,175 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 11 predicate places. [2022-01-18 22:49:10,175 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 80 transitions, 184 flow [2022-01-18 22:49:10,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:49:10,175 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:10,176 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] [2022-01-18 22:49:10,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:49:10,176 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash 29695000, now seen corresponding path program 1 times [2022-01-18 22:49:10,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:10,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173914989] [2022-01-18 22:49:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:10,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:10,635 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:49:10,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:10,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173914989] [2022-01-18 22:49:10,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173914989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:10,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:10,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-18 22:49:10,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406937591] [2022-01-18 22:49:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:10,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 22:49:10,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:10,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 22:49:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-01-18 22:49:10,640 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 96 [2022-01-18 22:49:10,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 80 transitions, 184 flow. Second operand has 13 states, 13 states have (on average 65.61538461538461) internal successors, (853), 13 states have internal predecessors, (853), 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:49:10,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:10,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 96 [2022-01-18 22:49:10,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:11,469 INFO L129 PetriNetUnfolder]: 422/1088 cut-off events. [2022-01-18 22:49:11,469 INFO L130 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-01-18 22:49:11,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 1088 events. 422/1088 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6938 event pairs, 43 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 1948. Up to 251 conditions per place. [2022-01-18 22:49:11,476 INFO L132 encePairwiseOnDemand]: 82/96 looper letters, 43 selfloop transitions, 10 changer transitions 93/199 dead transitions. [2022-01-18 22:49:11,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 199 transitions, 779 flow [2022-01-18 22:49:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 22:49:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-18 22:49:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1559 transitions. [2022-01-18 22:49:11,481 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7381628787878788 [2022-01-18 22:49:11,481 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1559 transitions. [2022-01-18 22:49:11,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1559 transitions. [2022-01-18 22:49:11,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:11,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1559 transitions. [2022-01-18 22:49:11,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 70.86363636363636) internal successors, (1559), 22 states have internal predecessors, (1559), 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:49:11,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 96.0) internal successors, (2208), 23 states have internal predecessors, (2208), 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:49:11,489 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 96.0) internal successors, (2208), 23 states have internal predecessors, (2208), 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:49:11,489 INFO L186 Difference]: Start difference. First operand has 110 places, 80 transitions, 184 flow. Second operand 22 states and 1559 transitions. [2022-01-18 22:49:11,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 199 transitions, 779 flow [2022-01-18 22:49:11,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 199 transitions, 721 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-01-18 22:49:11,496 INFO L242 Difference]: Finished difference. Result has 125 places, 85 transitions, 325 flow [2022-01-18 22:49:11,496 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=325, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2022-01-18 22:49:11,498 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 26 predicate places. [2022-01-18 22:49:11,498 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 325 flow [2022-01-18 22:49:11,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 65.61538461538461) internal successors, (853), 13 states have internal predecessors, (853), 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:49:11,498 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:11,499 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] [2022-01-18 22:49:11,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:49:11,499 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash -680867702, now seen corresponding path program 2 times [2022-01-18 22:49:11,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:11,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120522088] [2022-01-18 22:49:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:11,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:11,650 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:49:11,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:11,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120522088] [2022-01-18 22:49:11,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120522088] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:11,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:11,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:49:11,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020459640] [2022-01-18 22:49:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:11,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:49:11,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:49:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:49:11,656 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 96 [2022-01-18 22:49:11,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 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:49:11,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:11,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 96 [2022-01-18 22:49:11,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:11,849 INFO L129 PetriNetUnfolder]: 135/421 cut-off events. [2022-01-18 22:49:11,849 INFO L130 PetriNetUnfolder]: For 2759/2770 co-relation queries the response was YES. [2022-01-18 22:49:11,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 421 events. 135/421 cut-off events. For 2759/2770 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1864 event pairs, 7 based on Foata normal form. 21/440 useless extension candidates. Maximal degree in co-relation 1692. Up to 102 conditions per place. [2022-01-18 22:49:11,852 INFO L132 encePairwiseOnDemand]: 88/96 looper letters, 28 selfloop transitions, 5 changer transitions 31/127 dead transitions. [2022-01-18 22:49:11,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 127 transitions, 883 flow [2022-01-18 22:49:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:49:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:49:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 729 transitions. [2022-01-18 22:49:11,855 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.84375 [2022-01-18 22:49:11,855 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 729 transitions. [2022-01-18 22:49:11,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 729 transitions. [2022-01-18 22:49:11,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:11,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 729 transitions. [2022-01-18 22:49:11,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 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:49:11,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:11,858 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:11,858 INFO L186 Difference]: Start difference. First operand has 125 places, 85 transitions, 325 flow. Second operand 9 states and 729 transitions. [2022-01-18 22:49:11,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 127 transitions, 883 flow [2022-01-18 22:49:11,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 127 transitions, 796 flow, removed 38 selfloop flow, removed 9 redundant places. [2022-01-18 22:49:11,867 INFO L242 Difference]: Finished difference. Result has 114 places, 85 transitions, 322 flow [2022-01-18 22:49:11,867 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=322, PETRI_PLACES=114, PETRI_TRANSITIONS=85} [2022-01-18 22:49:11,868 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 15 predicate places. [2022-01-18 22:49:11,868 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 85 transitions, 322 flow [2022-01-18 22:49:11,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 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:49:11,868 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:11,868 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] [2022-01-18 22:49:11,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:49:11,869 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:11,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2086135495, now seen corresponding path program 1 times [2022-01-18 22:49:11,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:11,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773767378] [2022-01-18 22:49:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:11,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:12,023 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:49:12,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:12,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773767378] [2022-01-18 22:49:12,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773767378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:12,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:12,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:49:12,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062163033] [2022-01-18 22:49:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:12,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:49:12,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:49:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:49:12,027 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 96 [2022-01-18 22:49:12,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 85 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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:49:12,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:12,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 96 [2022-01-18 22:49:12,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:12,246 INFO L129 PetriNetUnfolder]: 37/192 cut-off events. [2022-01-18 22:49:12,247 INFO L130 PetriNetUnfolder]: For 857/860 co-relation queries the response was YES. [2022-01-18 22:49:12,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 192 events. 37/192 cut-off events. For 857/860 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 533 event pairs, 2 based on Foata normal form. 11/202 useless extension candidates. Maximal degree in co-relation 636. Up to 36 conditions per place. [2022-01-18 22:49:12,251 INFO L132 encePairwiseOnDemand]: 88/96 looper letters, 20 selfloop transitions, 7 changer transitions 19/109 dead transitions. [2022-01-18 22:49:12,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 648 flow [2022-01-18 22:49:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:49:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:49:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 785 transitions. [2022-01-18 22:49:12,254 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-01-18 22:49:12,254 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 785 transitions. [2022-01-18 22:49:12,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 785 transitions. [2022-01-18 22:49:12,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:12,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 785 transitions. [2022-01-18 22:49:12,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.5) internal successors, (785), 10 states have internal predecessors, (785), 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:49:12,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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:49:12,258 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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:49:12,258 INFO L186 Difference]: Start difference. First operand has 114 places, 85 transitions, 322 flow. Second operand 10 states and 785 transitions. [2022-01-18 22:49:12,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 648 flow [2022-01-18 22:49:12,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 573 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-01-18 22:49:12,263 INFO L242 Difference]: Finished difference. Result has 116 places, 85 transitions, 317 flow [2022-01-18 22:49:12,263 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=317, PETRI_PLACES=116, PETRI_TRANSITIONS=85} [2022-01-18 22:49:12,264 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 17 predicate places. [2022-01-18 22:49:12,264 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 85 transitions, 317 flow [2022-01-18 22:49:12,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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:49:12,264 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:12,264 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] [2022-01-18 22:49:12,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:49:12,265 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1572225826, now seen corresponding path program 1 times [2022-01-18 22:49:12,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:12,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188143450] [2022-01-18 22:49:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:12,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:12,385 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:49:12,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:12,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188143450] [2022-01-18 22:49:12,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188143450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:12,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:12,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:49:12,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692158255] [2022-01-18 22:49:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:12,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:49:12,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:49:12,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:49:12,388 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 96 [2022-01-18 22:49:12,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 85 transitions, 317 flow. Second operand has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 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:49:12,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:12,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 96 [2022-01-18 22:49:12,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:12,512 INFO L129 PetriNetUnfolder]: 13/153 cut-off events. [2022-01-18 22:49:12,513 INFO L130 PetriNetUnfolder]: For 308/310 co-relation queries the response was YES. [2022-01-18 22:49:12,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 153 events. 13/153 cut-off events. For 308/310 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 310 event pairs, 0 based on Foata normal form. 3/155 useless extension candidates. Maximal degree in co-relation 347. Up to 27 conditions per place. [2022-01-18 22:49:12,514 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 17 selfloop transitions, 1 changer transitions 15/97 dead transitions. [2022-01-18 22:49:12,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 97 transitions, 431 flow [2022-01-18 22:49:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:49:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:49:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 548 transitions. [2022-01-18 22:49:12,516 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-01-18 22:49:12,516 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 548 transitions. [2022-01-18 22:49:12,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 548 transitions. [2022-01-18 22:49:12,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:12,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 548 transitions. [2022-01-18 22:49:12,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 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:49:12,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:49:12,519 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:49:12,519 INFO L186 Difference]: Start difference. First operand has 116 places, 85 transitions, 317 flow. Second operand 7 states and 548 transitions. [2022-01-18 22:49:12,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 97 transitions, 431 flow [2022-01-18 22:49:12,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 97 transitions, 346 flow, removed 30 selfloop flow, removed 15 redundant places. [2022-01-18 22:49:12,523 INFO L242 Difference]: Finished difference. Result has 108 places, 81 transitions, 224 flow [2022-01-18 22:49:12,523 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=108, PETRI_TRANSITIONS=81} [2022-01-18 22:49:12,526 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 9 predicate places. [2022-01-18 22:49:12,526 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 81 transitions, 224 flow [2022-01-18 22:49:12,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 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:49:12,526 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:12,526 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] [2022-01-18 22:49:12,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:49:12,527 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1120703198, now seen corresponding path program 2 times [2022-01-18 22:49:12,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:12,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509723808] [2022-01-18 22:49:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:12,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:49:12,745 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:49:12,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:49:12,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509723808] [2022-01-18 22:49:12,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509723808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:49:12,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:49:12,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:49:12,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560410826] [2022-01-18 22:49:12,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:49:12,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:49:12,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:49:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:49:12,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:49:12,748 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2022-01-18 22:49:12,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 81 transitions, 224 flow. Second operand has 10 states, 10 states have (on average 73.9) internal successors, (739), 10 states have internal predecessors, (739), 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:49:12,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:49:12,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2022-01-18 22:49:12,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:49:12,876 INFO L129 PetriNetUnfolder]: 3/120 cut-off events. [2022-01-18 22:49:12,876 INFO L130 PetriNetUnfolder]: For 83/89 co-relation queries the response was YES. [2022-01-18 22:49:12,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 120 events. 3/120 cut-off events. For 83/89 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 0 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 214. Up to 12 conditions per place. [2022-01-18 22:49:12,877 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 15 selfloop transitions, 5 changer transitions 6/88 dead transitions. [2022-01-18 22:49:12,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 88 transitions, 310 flow [2022-01-18 22:49:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:49:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:49:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 675 transitions. [2022-01-18 22:49:12,879 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.78125 [2022-01-18 22:49:12,879 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 675 transitions. [2022-01-18 22:49:12,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 675 transitions. [2022-01-18 22:49:12,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:49:12,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 675 transitions. [2022-01-18 22:49:12,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.0) internal successors, (675), 9 states have internal predecessors, (675), 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:49:12,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:12,883 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:12,883 INFO L186 Difference]: Start difference. First operand has 108 places, 81 transitions, 224 flow. Second operand 9 states and 675 transitions. [2022-01-18 22:49:12,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 88 transitions, 310 flow [2022-01-18 22:49:12,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 88 transitions, 265 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-01-18 22:49:12,885 INFO L242 Difference]: Finished difference. Result has 104 places, 81 transitions, 215 flow [2022-01-18 22:49:12,885 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=104, PETRI_TRANSITIONS=81} [2022-01-18 22:49:12,886 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 5 predicate places. [2022-01-18 22:49:12,886 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 81 transitions, 215 flow [2022-01-18 22:49:12,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.9) internal successors, (739), 10 states have internal predecessors, (739), 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:49:12,886 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:49:12,887 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] [2022-01-18 22:49:12,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:49:12,887 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 22:49:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:49:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -325778338, now seen corresponding path program 3 times [2022-01-18 22:49:12,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:49:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309265763] [2022-01-18 22:49:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:49:12,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:49:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:49:12,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:49:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:49:13,056 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:49:13,057 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:49:13,057 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-18 22:49:13,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-18 22:49:13,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-18 22:49:13,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-18 22:49:13,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-18 22:49:13,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:49:13,062 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-01-18 22:49:13,066 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:49:13,066 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:49:13,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:49:13 BasicIcfg [2022-01-18 22:49:13,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:49:13,178 INFO L158 Benchmark]: Toolchain (without parser) took 5960.47ms. Allocated memory was 381.7MB in the beginning and 459.3MB in the end (delta: 77.6MB). Free memory was 326.2MB in the beginning and 235.6MB in the end (delta: 90.5MB). Peak memory consumption was 169.2MB. Max. memory is 16.0GB. [2022-01-18 22:49:13,178 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 381.7MB. Free memory is still 344.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:49:13,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.85ms. Allocated memory was 381.7MB in the beginning and 459.3MB in the end (delta: 77.6MB). Free memory was 326.0MB in the beginning and 418.2MB in the end (delta: -92.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. [2022-01-18 22:49:13,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.78ms. Allocated memory is still 459.3MB. Free memory was 418.2MB in the beginning and 414.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:49:13,179 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 459.3MB. Free memory was 414.0MB in the beginning and 411.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:49:13,180 INFO L158 Benchmark]: RCFGBuilder took 992.37ms. Allocated memory is still 459.3MB. Free memory was 411.9MB in the beginning and 308.1MB in the end (delta: 103.8MB). Peak memory consumption was 102.8MB. Max. memory is 16.0GB. [2022-01-18 22:49:13,180 INFO L158 Benchmark]: TraceAbstraction took 4317.84ms. Allocated memory is still 459.3MB. Free memory was 308.1MB in the beginning and 235.6MB in the end (delta: 72.5MB). Peak memory consumption was 74.6MB. Max. memory is 16.0GB. [2022-01-18 22:49:13,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 381.7MB. Free memory is still 344.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 526.85ms. Allocated memory was 381.7MB in the beginning and 459.3MB in the end (delta: 77.6MB). Free memory was 326.0MB in the beginning and 418.2MB in the end (delta: -92.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.78ms. Allocated memory is still 459.3MB. Free memory was 418.2MB in the beginning and 414.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 459.3MB. Free memory was 414.0MB in the beginning and 411.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 992.37ms. Allocated memory is still 459.3MB. Free memory was 411.9MB in the beginning and 308.1MB in the end (delta: 103.8MB). Peak memory consumption was 102.8MB. Max. memory is 16.0GB. * TraceAbstraction took 4317.84ms. Allocated memory is still 459.3MB. Free memory was 308.1MB in the beginning and 235.6MB in the end (delta: 72.5MB). Peak memory consumption was 74.6MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 pthread_t t1717; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1717, ((void *)0), P0, ((void *)0))=-1, t1717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t1718; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1718, ((void *)0), P1, ((void *)0))=0, t1717={5:0}, t1718={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L831] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L833] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L834] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L835] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L836] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$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: 813]: 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: 811]: 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 5 procedures, 115 locations, 5 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: 4.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 45 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=3, InterpolantAutomatonStates: 69, 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.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:49:13,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...