/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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:40:54,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:40:54,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:40:54,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:40:54,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:40:54,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:40:54,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:40:54,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:40:54,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:40:54,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:40:54,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:40:54,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:40:54,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:40:54,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:40:54,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:40:54,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:40:54,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:40:54,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:40:54,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:40:54,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:40:54,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:40:54,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:40:54,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:40:54,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:40:54,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:40:54,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:40:54,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:40:54,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:40:54,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:40:54,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:40:54,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:40:54,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:40:54,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:40:54,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:40:54,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:40:54,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:40:54,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:40:54,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:40:54,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:40:54,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:40:54,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:40:54,234 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-VariableLbe.epf [2023-01-28 00:40:54,245 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:40:54,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:40:54,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:40:54,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:40:54,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:40:54,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:40:54,249 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:40:54,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:40:54,250 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:40:54,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:40:54,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:40:54,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:40:54,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:40:54,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:40:54,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:40:54,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:40:54,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:40:54,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:40:54,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:40:54,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:40:54,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:40:54,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:40:54,253 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:40:54,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:40:54,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:40:54,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:40:54,486 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:40:54,487 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:40:54,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:40:55,470 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:40:55,602 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:40:55,603 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:40:55,610 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33fa07e5/6cccb0eaa3f345d9a913270d199b9bb5/FLAG06bfdcd1b [2023-01-28 00:40:55,624 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33fa07e5/6cccb0eaa3f345d9a913270d199b9bb5 [2023-01-28 00:40:55,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:40:55,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:40:55,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:40:55,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:40:55,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:40:55,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:40:55" (1/1) ... [2023-01-28 00:40:55,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5c3f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:55, skipping insertion in model container [2023-01-28 00:40:55,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:40:55" (1/1) ... [2023-01-28 00:40:55,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:40:55,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:40:55,815 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:40:55,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:40:55,993 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:40:56,002 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:40:56,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:40:56,077 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:40:56,077 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:40:56,082 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:40:56,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56 WrapperNode [2023-01-28 00:40:56,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:40:56,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:40:56,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:40:56,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:40:56,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,148 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2023-01-28 00:40:56,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:40:56,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:40:56,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:40:56,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:40:56,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:40:56,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:40:56,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:40:56,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:40:56,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (1/1) ... [2023-01-28 00:40:56,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:40:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:40:56,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:40:56,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:40:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:40:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:40:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:40:56,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:40:56,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:40:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:40:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:40:56,250 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:40:56,352 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:40:56,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:40:56,601 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:40:56,773 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:40:56,773 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:40:56,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:40:56 BoogieIcfgContainer [2023-01-28 00:40:56,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:40:56,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:40:56,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:40:56,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:40:56,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:40:55" (1/3) ... [2023-01-28 00:40:56,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd789a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:40:56, skipping insertion in model container [2023-01-28 00:40:56,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:56" (2/3) ... [2023-01-28 00:40:56,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd789a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:40:56, skipping insertion in model container [2023-01-28 00:40:56,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:40:56" (3/3) ... [2023-01-28 00:40:56,783 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:40:56,797 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:40:56,797 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:40:56,797 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:40:56,838 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:40:56,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-01-28 00:40:56,921 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-01-28 00:40:56,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:40:56,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-01-28 00:40:56,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-01-28 00:40:56,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-01-28 00:40:56,931 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:40:56,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-01-28 00:40:56,944 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-01-28 00:40:56,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-01-28 00:40:56,978 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-01-28 00:40:56,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:40:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-01-28 00:40:56,981 INFO L119 LiptonReduction]: Number of co-enabled transitions 2308 [2023-01-28 00:40:59,344 INFO L134 LiptonReduction]: Checked pairs total: 6373 [2023-01-28 00:40:59,344 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-01-28 00:40:59,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:40:59,367 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b667137, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:40:59,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:40:59,369 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:40:59,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:40:59,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:59,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:40:59,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:59,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash 495318, now seen corresponding path program 1 times [2023-01-28 00:40:59,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120380185] [2023-01-28 00:40:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:40:59,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:59,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120380185] [2023-01-28 00:40:59,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120380185] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:59,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:59,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:40:59,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839145475] [2023-01-28 00:40:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:40:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:40:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:40:59,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 215 [2023-01-28 00:40:59,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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) [2023-01-28 00:40:59,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:59,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 215 [2023-01-28 00:40:59,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:59,950 INFO L130 PetriNetUnfolder]: 1144/1841 cut-off events. [2023-01-28 00:40:59,950 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-01-28 00:40:59,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1841 events. 1144/1841 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9900 event pairs, 184 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 3578. Up to 1372 conditions per place. [2023-01-28 00:40:59,959 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-01-28 00:40:59,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-01-28 00:40:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:40:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:40:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-01-28 00:40:59,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364341085271318 [2023-01-28 00:40:59,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-01-28 00:40:59,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-01-28 00:40:59,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:59,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-01-28 00:40:59,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-01-28 00:40:59,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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) [2023-01-28 00:40:59,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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) [2023-01-28 00:40:59,978 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 346 transitions. [2023-01-28 00:40:59,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-01-28 00:40:59,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:40:59,981 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-01-28 00:40:59,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-01-28 00:40:59,984 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-28 00:40:59,984 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-01-28 00:40:59,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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) [2023-01-28 00:40:59,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:59,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:59,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:40:59,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:59,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash 394905544, now seen corresponding path program 1 times [2023-01-28 00:40:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359263718] [2023-01-28 00:40:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:00,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:00,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359263718] [2023-01-28 00:41:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359263718] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:41:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381100627] [2023-01-28 00:41:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:00,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:41:00,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:41:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:41:00,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-01-28 00:41:00,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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) [2023-01-28 00:41:00,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:00,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-01-28 00:41:00,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:00,664 INFO L130 PetriNetUnfolder]: 2459/3678 cut-off events. [2023-01-28 00:41:00,664 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-01-28 00:41:00,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7618 conditions, 3678 events. 2459/3678 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18066 event pairs, 815 based on Foata normal form. 112/3790 useless extension candidates. Maximal degree in co-relation 7608. Up to 2550 conditions per place. [2023-01-28 00:41:00,678 INFO L137 encePairwiseOnDemand]: 207/215 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-01-28 00:41:00,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 178 flow [2023-01-28 00:41:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:41:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:41:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-01-28 00:41:00,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930232558139535 [2023-01-28 00:41:00,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-01-28 00:41:00,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-01-28 00:41:00,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:00,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-01-28 00:41:00,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-01-28 00:41:00,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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) [2023-01-28 00:41:00,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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) [2023-01-28 00:41:00,688 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 318 transitions. [2023-01-28 00:41:00,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 178 flow [2023-01-28 00:41:00,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:41:00,689 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 106 flow [2023-01-28 00:41:00,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-01-28 00:41:00,690 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2023-01-28 00:41:00,690 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 106 flow [2023-01-28 00:41:00,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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) [2023-01-28 00:41:00,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:00,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:00,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:41:00,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:00,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash -642830926, now seen corresponding path program 1 times [2023-01-28 00:41:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714099231] [2023-01-28 00:41:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714099231] [2023-01-28 00:41:00,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714099231] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:00,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:00,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:41:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458521646] [2023-01-28 00:41:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:00,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-01-28 00:41:00,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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) [2023-01-28 00:41:00,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:00,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-01-28 00:41:00,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:01,221 INFO L130 PetriNetUnfolder]: 2285/3424 cut-off events. [2023-01-28 00:41:01,222 INFO L131 PetriNetUnfolder]: For 1275/1275 co-relation queries the response was YES. [2023-01-28 00:41:01,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8557 conditions, 3424 events. 2285/3424 cut-off events. For 1275/1275 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16681 event pairs, 468 based on Foata normal form. 50/3474 useless extension candidates. Maximal degree in co-relation 8545. Up to 1837 conditions per place. [2023-01-28 00:41:01,233 INFO L137 encePairwiseOnDemand]: 208/215 looper letters, 48 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-01-28 00:41:01,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 288 flow [2023-01-28 00:41:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:41:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:41:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-01-28 00:41:01,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872093023255814 [2023-01-28 00:41:01,235 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-01-28 00:41:01,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-01-28 00:41:01,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:01,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-01-28 00:41:01,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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) [2023-01-28 00:41:01,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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) [2023-01-28 00:41:01,238 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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) [2023-01-28 00:41:01,238 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 106 flow. Second operand 4 states and 419 transitions. [2023-01-28 00:41:01,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 288 flow [2023-01-28 00:41:01,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:41:01,243 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 140 flow [2023-01-28 00:41:01,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-01-28 00:41:01,244 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-01-28 00:41:01,244 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 140 flow [2023-01-28 00:41:01,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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) [2023-01-28 00:41:01,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:01,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:01,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:41:01,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:01,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1444226747, now seen corresponding path program 1 times [2023-01-28 00:41:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288284759] [2023-01-28 00:41:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:01,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288284759] [2023-01-28 00:41:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288284759] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:41:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744365722] [2023-01-28 00:41:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:01,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:01,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-01-28 00:41:01,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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) [2023-01-28 00:41:01,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:01,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-01-28 00:41:01,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:01,608 INFO L130 PetriNetUnfolder]: 2149/3224 cut-off events. [2023-01-28 00:41:01,608 INFO L131 PetriNetUnfolder]: For 2464/2464 co-relation queries the response was YES. [2023-01-28 00:41:01,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8554 conditions, 3224 events. 2149/3224 cut-off events. For 2464/2464 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14754 event pairs, 634 based on Foata normal form. 40/3264 useless extension candidates. Maximal degree in co-relation 8539. Up to 1596 conditions per place. [2023-01-28 00:41:01,621 INFO L137 encePairwiseOnDemand]: 207/215 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-01-28 00:41:01,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 324 flow [2023-01-28 00:41:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:41:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:41:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-01-28 00:41:01,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48255813953488375 [2023-01-28 00:41:01,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-01-28 00:41:01,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-01-28 00:41:01,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:01,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-01-28 00:41:01,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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) [2023-01-28 00:41:01,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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) [2023-01-28 00:41:01,625 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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) [2023-01-28 00:41:01,625 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 140 flow. Second operand 4 states and 415 transitions. [2023-01-28 00:41:01,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 324 flow [2023-01-28 00:41:01,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:41:01,629 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 226 flow [2023-01-28 00:41:01,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-01-28 00:41:01,630 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2023-01-28 00:41:01,630 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 226 flow [2023-01-28 00:41:01,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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) [2023-01-28 00:41:01,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:01,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:01,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:41:01,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:01,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1526699762, now seen corresponding path program 1 times [2023-01-28 00:41:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:01,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142898970] [2023-01-28 00:41:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142898970] [2023-01-28 00:41:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142898970] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:41:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17467303] [2023-01-28 00:41:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:01,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:01,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:01,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-01-28 00:41:01,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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) [2023-01-28 00:41:01,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:01,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-01-28 00:41:01,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:01,989 INFO L130 PetriNetUnfolder]: 1301/2184 cut-off events. [2023-01-28 00:41:01,989 INFO L131 PetriNetUnfolder]: For 2266/2318 co-relation queries the response was YES. [2023-01-28 00:41:01,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 2184 events. 1301/2184 cut-off events. For 2266/2318 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12042 event pairs, 236 based on Foata normal form. 244/2395 useless extension candidates. Maximal degree in co-relation 5950. Up to 1136 conditions per place. [2023-01-28 00:41:01,997 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 74 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2023-01-28 00:41:01,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 665 flow [2023-01-28 00:41:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:41:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:41:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-01-28 00:41:01,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023255813953489 [2023-01-28 00:41:01,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-01-28 00:41:01,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-01-28 00:41:01,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:01,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-01-28 00:41:02,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 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) [2023-01-28 00:41:02,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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) [2023-01-28 00:41:02,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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) [2023-01-28 00:41:02,002 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 226 flow. Second operand 5 states and 540 transitions. [2023-01-28 00:41:02,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 665 flow [2023-01-28 00:41:02,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:41:02,005 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 282 flow [2023-01-28 00:41:02,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-01-28 00:41:02,006 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-01-28 00:41:02,006 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 282 flow [2023-01-28 00:41:02,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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) [2023-01-28 00:41:02,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:02,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:02,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:41:02,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:02,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash -160325713, now seen corresponding path program 1 times [2023-01-28 00:41:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330011] [2023-01-28 00:41:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330011] [2023-01-28 00:41:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330011] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:02,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:02,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:41:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091048765] [2023-01-28 00:41:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:02,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:02,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 215 [2023-01-28 00:41:02,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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) [2023-01-28 00:41:02,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:02,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 215 [2023-01-28 00:41:02,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:02,472 INFO L130 PetriNetUnfolder]: 2047/3309 cut-off events. [2023-01-28 00:41:02,472 INFO L131 PetriNetUnfolder]: For 6395/6395 co-relation queries the response was YES. [2023-01-28 00:41:02,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12001 conditions, 3309 events. 2047/3309 cut-off events. For 6395/6395 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17991 event pairs, 122 based on Foata normal form. 36/3345 useless extension candidates. Maximal degree in co-relation 11978. Up to 1483 conditions per place. [2023-01-28 00:41:02,484 INFO L137 encePairwiseOnDemand]: 206/215 looper letters, 62 selfloop transitions, 23 changer transitions 14/99 dead transitions. [2023-01-28 00:41:02,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 99 transitions, 766 flow [2023-01-28 00:41:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:41:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:41:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-01-28 00:41:02,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772093023255814 [2023-01-28 00:41:02,486 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-01-28 00:41:02,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-01-28 00:41:02,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:02,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-01-28 00:41:02,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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) [2023-01-28 00:41:02,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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) [2023-01-28 00:41:02,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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) [2023-01-28 00:41:02,488 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 282 flow. Second operand 5 states and 513 transitions. [2023-01-28 00:41:02,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 99 transitions, 766 flow [2023-01-28 00:41:02,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:41:02,499 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 435 flow [2023-01-28 00:41:02,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=435, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-01-28 00:41:02,499 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-01-28 00:41:02,500 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 435 flow [2023-01-28 00:41:02,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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) [2023-01-28 00:41:02,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:02,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:02,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:41:02,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:02,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 818513441, now seen corresponding path program 1 times [2023-01-28 00:41:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640089053] [2023-01-28 00:41:02,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640089053] [2023-01-28 00:41:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640089053] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:02,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:02,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:41:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455997475] [2023-01-28 00:41:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:02,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:41:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:41:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:41:02,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-01-28 00:41:02,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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) [2023-01-28 00:41:02,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:02,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-01-28 00:41:02,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:02,843 INFO L130 PetriNetUnfolder]: 760/1404 cut-off events. [2023-01-28 00:41:02,843 INFO L131 PetriNetUnfolder]: For 2930/2991 co-relation queries the response was YES. [2023-01-28 00:41:02,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 1404 events. 760/1404 cut-off events. For 2930/2991 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7710 event pairs, 152 based on Foata normal form. 161/1547 useless extension candidates. Maximal degree in co-relation 4993. Up to 474 conditions per place. [2023-01-28 00:41:02,849 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 80 selfloop transitions, 11 changer transitions 20/129 dead transitions. [2023-01-28 00:41:02,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 129 transitions, 1197 flow [2023-01-28 00:41:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:41:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:41:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-01-28 00:41:02,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031007751937985 [2023-01-28 00:41:02,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-01-28 00:41:02,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-01-28 00:41:02,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:02,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-01-28 00:41:02,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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) [2023-01-28 00:41:02,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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) [2023-01-28 00:41:02,854 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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) [2023-01-28 00:41:02,854 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 435 flow. Second operand 6 states and 649 transitions. [2023-01-28 00:41:02,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 129 transitions, 1197 flow [2023-01-28 00:41:02,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 129 transitions, 1181 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 00:41:02,861 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 515 flow [2023-01-28 00:41:02,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-01-28 00:41:02,862 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-01-28 00:41:02,862 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 515 flow [2023-01-28 00:41:02,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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) [2023-01-28 00:41:02,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:02,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:41:02,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:02,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1189178268, now seen corresponding path program 1 times [2023-01-28 00:41:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061204448] [2023-01-28 00:41:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:03,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061204448] [2023-01-28 00:41:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061204448] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:41:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295819541] [2023-01-28 00:41:03,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:03,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:41:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:41:03,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:41:03,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-01-28 00:41:03,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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) [2023-01-28 00:41:03,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:03,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-01-28 00:41:03,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:03,331 INFO L130 PetriNetUnfolder]: 714/1309 cut-off events. [2023-01-28 00:41:03,331 INFO L131 PetriNetUnfolder]: For 3401/3456 co-relation queries the response was YES. [2023-01-28 00:41:03,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 1309 events. 714/1309 cut-off events. For 3401/3456 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7140 event pairs, 145 based on Foata normal form. 46/1337 useless extension candidates. Maximal degree in co-relation 5289. Up to 451 conditions per place. [2023-01-28 00:41:03,341 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 67 selfloop transitions, 14 changer transitions 31/130 dead transitions. [2023-01-28 00:41:03,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 130 transitions, 1243 flow [2023-01-28 00:41:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:41:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:41:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 842 transitions. [2023-01-28 00:41:03,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48953488372093024 [2023-01-28 00:41:03,343 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 842 transitions. [2023-01-28 00:41:03,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 842 transitions. [2023-01-28 00:41:03,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:03,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 842 transitions. [2023-01-28 00:41:03,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.25) internal successors, (842), 8 states have internal predecessors, (842), 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) [2023-01-28 00:41:03,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 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) [2023-01-28 00:41:03,347 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 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) [2023-01-28 00:41:03,347 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 515 flow. Second operand 8 states and 842 transitions. [2023-01-28 00:41:03,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 130 transitions, 1243 flow [2023-01-28 00:41:03,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 130 transitions, 1187 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-01-28 00:41:03,368 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 501 flow [2023-01-28 00:41:03,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=501, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-01-28 00:41:03,370 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-01-28 00:41:03,370 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 501 flow [2023-01-28 00:41:03,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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) [2023-01-28 00:41:03,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:03,371 INFO L208 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] [2023-01-28 00:41:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:41:03,371 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:03,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash -224199300, now seen corresponding path program 1 times [2023-01-28 00:41:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539713961] [2023-01-28 00:41:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539713961] [2023-01-28 00:41:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539713961] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:03,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:03,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:41:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222013936] [2023-01-28 00:41:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:03,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:41:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:03,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:41:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:41:03,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 215 [2023-01-28 00:41:03,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 501 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 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) [2023-01-28 00:41:03,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:03,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 215 [2023-01-28 00:41:03,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:04,091 INFO L130 PetriNetUnfolder]: 1024/1954 cut-off events. [2023-01-28 00:41:04,091 INFO L131 PetriNetUnfolder]: For 6745/6845 co-relation queries the response was YES. [2023-01-28 00:41:04,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 1954 events. 1024/1954 cut-off events. For 6745/6845 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12434 event pairs, 194 based on Foata normal form. 17/1958 useless extension candidates. Maximal degree in co-relation 8105. Up to 971 conditions per place. [2023-01-28 00:41:04,099 INFO L137 encePairwiseOnDemand]: 208/215 looper letters, 66 selfloop transitions, 7 changer transitions 56/147 dead transitions. [2023-01-28 00:41:04,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 1431 flow [2023-01-28 00:41:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:41:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:41:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2023-01-28 00:41:04,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023255813953489 [2023-01-28 00:41:04,101 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2023-01-28 00:41:04,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2023-01-28 00:41:04,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:04,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2023-01-28 00:41:04,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 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) [2023-01-28 00:41:04,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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) [2023-01-28 00:41:04,105 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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) [2023-01-28 00:41:04,105 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 501 flow. Second operand 6 states and 648 transitions. [2023-01-28 00:41:04,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 1431 flow [2023-01-28 00:41:04,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 1247 flow, removed 46 selfloop flow, removed 8 redundant places. [2023-01-28 00:41:04,127 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 533 flow [2023-01-28 00:41:04,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-01-28 00:41:04,128 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-01-28 00:41:04,128 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 533 flow [2023-01-28 00:41:04,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 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) [2023-01-28 00:41:04,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:04,129 INFO L208 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] [2023-01-28 00:41:04,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:41:04,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:04,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1428258288, now seen corresponding path program 2 times [2023-01-28 00:41:04,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210812658] [2023-01-28 00:41:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:41:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210812658] [2023-01-28 00:41:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210812658] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:04,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:41:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629380665] [2023-01-28 00:41:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:41:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:41:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:41:04,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-01-28 00:41:04,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 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) [2023-01-28 00:41:04,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:04,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-01-28 00:41:04,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:05,222 INFO L130 PetriNetUnfolder]: 852/1697 cut-off events. [2023-01-28 00:41:05,223 INFO L131 PetriNetUnfolder]: For 6093/6249 co-relation queries the response was YES. [2023-01-28 00:41:05,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 1697 events. 852/1697 cut-off events. For 6093/6249 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10978 event pairs, 81 based on Foata normal form. 67/1753 useless extension candidates. Maximal degree in co-relation 7399. Up to 965 conditions per place. [2023-01-28 00:41:05,229 INFO L137 encePairwiseOnDemand]: 210/215 looper letters, 72 selfloop transitions, 4 changer transitions 32/126 dead transitions. [2023-01-28 00:41:05,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 126 transitions, 1168 flow [2023-01-28 00:41:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:41:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:41:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-01-28 00:41:05,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47364341085271316 [2023-01-28 00:41:05,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-01-28 00:41:05,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-01-28 00:41:05,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:05,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-01-28 00:41:05,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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) [2023-01-28 00:41:05,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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) [2023-01-28 00:41:05,234 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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) [2023-01-28 00:41:05,234 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 533 flow. Second operand 6 states and 611 transitions. [2023-01-28 00:41:05,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 126 transitions, 1168 flow [2023-01-28 00:41:05,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 1158 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 00:41:05,252 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 547 flow [2023-01-28 00:41:05,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-01-28 00:41:05,252 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2023-01-28 00:41:05,252 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 547 flow [2023-01-28 00:41:05,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 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) [2023-01-28 00:41:05,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:05,253 INFO L208 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] [2023-01-28 00:41:05,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:41:05,253 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:41:05,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1888012336, now seen corresponding path program 3 times [2023-01-28 00:41:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232825359] [2023-01-28 00:41:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:41:05,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:41:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:41:05,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:41:05,326 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:41:05,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:41:05,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:41:05,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:41:05,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:41:05,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:41:05,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:41:05,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:41:05,328 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:05,331 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:41:05,332 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:41:05,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:41:05 BasicIcfg [2023-01-28 00:41:05,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:41:05,369 INFO L158 Benchmark]: Toolchain (without parser) took 9742.55ms. Allocated memory was 555.7MB in the beginning and 864.0MB in the end (delta: 308.3MB). Free memory was 503.7MB in the beginning and 364.4MB in the end (delta: 139.3MB). Peak memory consumption was 448.8MB. Max. memory is 16.0GB. [2023-01-28 00:41:05,370 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 337.6MB. Free memory is still 285.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:41:05,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.20ms. Allocated memory is still 555.7MB. Free memory was 503.7MB in the beginning and 480.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:41:05,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.61ms. Allocated memory is still 555.7MB. Free memory was 480.3MB in the beginning and 477.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:41:05,370 INFO L158 Benchmark]: Boogie Preprocessor took 32.32ms. Allocated memory is still 555.7MB. Free memory was 477.9MB in the beginning and 475.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:41:05,370 INFO L158 Benchmark]: RCFGBuilder took 593.54ms. Allocated memory is still 555.7MB. Free memory was 475.8MB in the beginning and 508.8MB in the end (delta: -33.0MB). Peak memory consumption was 33.9MB. Max. memory is 16.0GB. [2023-01-28 00:41:05,371 INFO L158 Benchmark]: TraceAbstraction took 8592.45ms. Allocated memory was 555.7MB in the beginning and 864.0MB in the end (delta: 308.3MB). Free memory was 508.8MB in the beginning and 364.4MB in the end (delta: 144.4MB). Peak memory consumption was 452.6MB. Max. memory is 16.0GB. [2023-01-28 00:41:05,371 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.09ms. Allocated memory is still 337.6MB. Free memory is still 285.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 454.20ms. Allocated memory is still 555.7MB. Free memory was 503.7MB in the beginning and 480.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.61ms. Allocated memory is still 555.7MB. Free memory was 480.3MB in the beginning and 477.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.32ms. Allocated memory is still 555.7MB. Free memory was 477.9MB in the beginning and 475.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 593.54ms. Allocated memory is still 555.7MB. Free memory was 475.8MB in the beginning and 508.8MB in the end (delta: -33.0MB). Peak memory consumption was 33.9MB. Max. memory is 16.0GB. * TraceAbstraction took 8592.45ms. Allocated memory was 555.7MB in the beginning and 864.0MB in the end (delta: 308.3MB). Free memory was 508.8MB in the beginning and 364.4MB in the end (delta: 144.4MB). Peak memory consumption was 452.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 121 PlacesBefore, 35 PlacesAfterwards, 113 TransitionsBefore, 26 TransitionsAfterwards, 2308 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 6373 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3208, independent: 2999, independent conditional: 0, independent unconditional: 2999, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1301, independent: 1257, independent conditional: 0, independent unconditional: 1257, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3208, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1301, unknown conditional: 0, unknown unconditional: 1301] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=-3, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=-2, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=-1, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 16 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2023-01-28 00:41:05,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...