/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/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:41:38,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:41:38,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:41:38,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:41:38,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:41:38,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:41:38,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:41:38,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:41:38,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:41:38,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:41:38,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:41:38,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:41:38,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:41:38,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:41:38,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:41:38,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:41:38,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:41:38,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:41:38,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:41:38,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:41:38,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:41:38,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:41:38,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:41:38,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:41:38,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:41:38,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:41:38,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:41:38,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:41:38,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:41:38,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:41:38,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:41:38,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:41:38,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:41:38,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:41:38,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:41:38,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:41:38,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:41:38,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:41:38,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:41:38,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:41:38,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:41:38,171 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:41:38,200 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:41:38,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:41:38,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:41:38,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:41:38,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:41:38,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:41:38,203 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:41:38,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:41:38,203 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:41:38,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:41:38,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:41:38,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:41:38,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:41:38,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:41:38,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:41:38,204 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:41:38,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:41:38,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:41:38,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:41:38,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:41:38,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:41:38,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:41:38,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:41:38,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:41:38,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:41:38,206 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:41:38,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:41:38,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:41:38,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:41:38,476 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:41:38,479 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:41:38,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:41:39,694 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:41:39,914 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:41:39,914 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:41:39,933 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4597c304/9cb4c8796b54467987f7fae1e5c550fb/FLAG65747ad77 [2023-01-28 00:41:39,945 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4597c304/9cb4c8796b54467987f7fae1e5c550fb [2023-01-28 00:41:39,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:41:39,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:41:39,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:41:39,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:41:39,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:41:39,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:41:39" (1/1) ... [2023-01-28 00:41:39,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212af722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:39, skipping insertion in model container [2023-01-28 00:41:39,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:41:39" (1/1) ... [2023-01-28 00:41:39,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:41:40,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:41:40,138 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:41:40,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:41:40,378 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:41:40,392 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:41:40,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:41:40,483 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:41:40,483 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:41:40,489 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:41:40,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40 WrapperNode [2023-01-28 00:41:40,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:41:40,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:41:40,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:41:40,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:41:40,497 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:41:40" (1/1) ... [2023-01-28 00:41:40,522 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:41:40" (1/1) ... [2023-01-28 00:41:40,561 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-01-28 00:41:40,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:41:40,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:41:40,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:41:40,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:41:40,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,596 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:41:40,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:41:40,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:41:40,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:41:40,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (1/1) ... [2023-01-28 00:41:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:41:40,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:41:40,645 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:41:40,646 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:41:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:41:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:41:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:41:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:41:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:41:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:41:40,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:41:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:41:40,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:41:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:41:40,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:41:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:41:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:41:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:41:40,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:41:40,679 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:41:40,794 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:41:40,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:41:41,089 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:41:41,207 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:41:41,208 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:41:41,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:41:41 BoogieIcfgContainer [2023-01-28 00:41:41,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:41:41,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:41:41,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:41:41,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:41:41,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:41:39" (1/3) ... [2023-01-28 00:41:41,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e445f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:41:41, skipping insertion in model container [2023-01-28 00:41:41,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:41:40" (2/3) ... [2023-01-28 00:41:41,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e445f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:41:41, skipping insertion in model container [2023-01-28 00:41:41,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:41:41" (3/3) ... [2023-01-28 00:41:41,217 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:41:41,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:41:41,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:41:41,233 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:41:41,301 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:41:41,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-01-28 00:41:41,375 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-28 00:41:41,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:41:41,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-28 00:41:41,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-01-28 00:41:41,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-01-28 00:41:41,386 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:41:41,394 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-28 00:41:41,397 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-28 00:41:41,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-01-28 00:41:41,420 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-28 00:41:41,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:41:41,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-28 00:41:41,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-01-28 00:41:44,693 INFO L134 LiptonReduction]: Checked pairs total: 5396 [2023-01-28 00:41:44,693 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-28 00:41:44,706 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:41:44,711 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;@5e4f462b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:41:44,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:41:44,713 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:41:44,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:41:44,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:44,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:41:44,714 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:41:44,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 484427, now seen corresponding path program 1 times [2023-01-28 00:41:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562580349] [2023-01-28 00:41:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:45,048 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:45,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:45,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562580349] [2023-01-28 00:41:45,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562580349] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:45,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:41:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283051298] [2023-01-28 00:41:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:45,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:41:45,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:41:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:41:45,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 209 [2023-01-28 00:41:45,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:45,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:45,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 209 [2023-01-28 00:41:45,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:45,405 INFO L130 PetriNetUnfolder]: 1079/1667 cut-off events. [2023-01-28 00:41:45,405 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 00:41:45,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 1667 events. 1079/1667 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7952 event pairs, 301 based on Foata normal form. 0/1570 useless extension candidates. Maximal degree in co-relation 3303. Up to 1297 conditions per place. [2023-01-28 00:41:45,420 INFO L137 encePairwiseOnDemand]: 205/209 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-01-28 00:41:45,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 167 flow [2023-01-28 00:41:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:41:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:41:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-01-28 00:41:45,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532695374800638 [2023-01-28 00:41:45,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-01-28 00:41:45,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-01-28 00:41:45,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:45,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-01-28 00:41:45,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:45,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:45,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:45,449 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 334 transitions. [2023-01-28 00:41:45,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 167 flow [2023-01-28 00:41:45,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:41:45,454 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-28 00:41:45,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-28 00:41:45,458 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 00:41:45,458 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-28 00:41:45,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:45,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:45,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:41:45,459 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:41:45,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 353077464, now seen corresponding path program 1 times [2023-01-28 00:41:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:45,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987467468] [2023-01-28 00:41:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:45,823 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:45,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987467468] [2023-01-28 00:41:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987467468] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:41:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784141557] [2023-01-28 00:41:45,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:45,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:41:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:41:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:41:45,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-28 00:41:45,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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:45,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:45,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-28 00:41:45,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:46,196 INFO L130 PetriNetUnfolder]: 2001/3012 cut-off events. [2023-01-28 00:41:46,196 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2023-01-28 00:41:46,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 3012 events. 2001/3012 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14400 event pairs, 651 based on Foata normal form. 94/3106 useless extension candidates. Maximal degree in co-relation 6234. Up to 2040 conditions per place. [2023-01-28 00:41:46,212 INFO L137 encePairwiseOnDemand]: 202/209 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-01-28 00:41:46,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 170 flow [2023-01-28 00:41:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:41:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:41:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-01-28 00:41:46,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944178628389155 [2023-01-28 00:41:46,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-01-28 00:41:46,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-01-28 00:41:46,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:46,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-01-28 00:41:46,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:46,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:46,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:46,222 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 310 transitions. [2023-01-28 00:41:46,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 170 flow [2023-01-28 00:41:46,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:41:46,224 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2023-01-28 00:41:46,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-01-28 00:41:46,225 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-01-28 00:41:46,225 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2023-01-28 00:41:46,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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:46,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:46,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:46,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:41:46,226 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:46,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1939501328, now seen corresponding path program 1 times [2023-01-28 00:41:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539931021] [2023-01-28 00:41:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:46,454 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:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539931021] [2023-01-28 00:41:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539931021] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:41:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933855652] [2023-01-28 00:41:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:46,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:46,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-28 00:41:46,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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:46,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:46,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-28 00:41:46,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:46,893 INFO L130 PetriNetUnfolder]: 1865/2812 cut-off events. [2023-01-28 00:41:46,893 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2023-01-28 00:41:46,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 2812 events. 1865/2812 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12789 event pairs, 553 based on Foata normal form. 40/2852 useless extension candidates. Maximal degree in co-relation 6940. Up to 1428 conditions per place. [2023-01-28 00:41:46,908 INFO L137 encePairwiseOnDemand]: 202/209 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-01-28 00:41:46,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 240 flow [2023-01-28 00:41:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:41:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:41:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-01-28 00:41:46,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2023-01-28 00:41:46,911 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-01-28 00:41:46,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-01-28 00:41:46,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:46,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-01-28 00:41:46,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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:46,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:46,915 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:46,915 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 4 states and 404 transitions. [2023-01-28 00:41:46,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 240 flow [2023-01-28 00:41:46,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:41:46,923 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2023-01-28 00:41:46,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-01-28 00:41:46,924 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-01-28 00:41:46,927 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 132 flow [2023-01-28 00:41:46,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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:46,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:46,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:46,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:41:46,929 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:46,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash -34018649, now seen corresponding path program 1 times [2023-01-28 00:41:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026210853] [2023-01-28 00:41:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:47,131 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:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026210853] [2023-01-28 00:41:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026210853] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:41:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434444968] [2023-01-28 00:41:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:47,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:47,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:47,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-28 00:41:47,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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:47,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:47,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-28 00:41:47,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:47,522 INFO L130 PetriNetUnfolder]: 1826/2753 cut-off events. [2023-01-28 00:41:47,523 INFO L131 PetriNetUnfolder]: For 1848/1848 co-relation queries the response was YES. [2023-01-28 00:41:47,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 2753 events. 1826/2753 cut-off events. For 1848/1848 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13032 event pairs, 350 based on Foata normal form. 8/2761 useless extension candidates. Maximal degree in co-relation 7246. Up to 1795 conditions per place. [2023-01-28 00:41:47,539 INFO L137 encePairwiseOnDemand]: 202/209 looper letters, 43 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2023-01-28 00:41:47,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 322 flow [2023-01-28 00:41:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:41:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:41:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-01-28 00:41:47,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49282296650717705 [2023-01-28 00:41:47,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-01-28 00:41:47,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-01-28 00:41:47,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:47,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-01-28 00:41:47,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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:47,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:47,552 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:47,552 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 132 flow. Second operand 4 states and 412 transitions. [2023-01-28 00:41:47,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 322 flow [2023-01-28 00:41:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:41:47,559 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 201 flow [2023-01-28 00:41:47,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-28 00:41:47,561 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-28 00:41:47,561 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 201 flow [2023-01-28 00:41:47,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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:47,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:47,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:47,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:41:47,563 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:47,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1054541743, now seen corresponding path program 1 times [2023-01-28 00:41:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:47,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163567142] [2023-01-28 00:41:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:47,802 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:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163567142] [2023-01-28 00:41:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163567142] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:41:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67746440] [2023-01-28 00:41:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:47,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:47,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-28 00:41:47,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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:47,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:47,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-28 00:41:47,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:48,115 INFO L130 PetriNetUnfolder]: 1129/1884 cut-off events. [2023-01-28 00:41:48,115 INFO L131 PetriNetUnfolder]: For 1904/1987 co-relation queries the response was YES. [2023-01-28 00:41:48,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 1884 events. 1129/1884 cut-off events. For 1904/1987 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10100 event pairs, 195 based on Foata normal form. 222/2071 useless extension candidates. Maximal degree in co-relation 5243. Up to 1041 conditions per place. [2023-01-28 00:41:48,126 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 71 selfloop transitions, 7 changer transitions 4/89 dead transitions. [2023-01-28 00:41:48,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 89 transitions, 640 flow [2023-01-28 00:41:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:41:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:41:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-28 00:41:48,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2023-01-28 00:41:48,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-28 00:41:48,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-28 00:41:48,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:48,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-28 00:41:48,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 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:48,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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:48,133 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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:48,133 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 201 flow. Second operand 5 states and 510 transitions. [2023-01-28 00:41:48,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 89 transitions, 640 flow [2023-01-28 00:41:48,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 89 transitions, 636 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-28 00:41:48,140 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 253 flow [2023-01-28 00:41:48,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-01-28 00:41:48,142 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-28 00:41:48,142 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 253 flow [2023-01-28 00:41:48,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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:48,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:48,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:48,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:41:48,144 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:48,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash -423934774, now seen corresponding path program 1 times [2023-01-28 00:41:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972171218] [2023-01-28 00:41:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:48,335 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:48,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:48,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972171218] [2023-01-28 00:41:48,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972171218] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:41:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996815430] [2023-01-28 00:41:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:48,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:41:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:48,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:41:48,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:41:48,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 209 [2023-01-28 00:41:48,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:48,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:48,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 209 [2023-01-28 00:41:48,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:48,647 INFO L130 PetriNetUnfolder]: 1474/2492 cut-off events. [2023-01-28 00:41:48,647 INFO L131 PetriNetUnfolder]: For 4024/4028 co-relation queries the response was YES. [2023-01-28 00:41:48,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8693 conditions, 2492 events. 1474/2492 cut-off events. For 4024/4028 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13877 event pairs, 641 based on Foata normal form. 40/2500 useless extension candidates. Maximal degree in co-relation 8670. Up to 1346 conditions per place. [2023-01-28 00:41:48,662 INFO L137 encePairwiseOnDemand]: 206/209 looper letters, 44 selfloop transitions, 6 changer transitions 9/61 dead transitions. [2023-01-28 00:41:48,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 461 flow [2023-01-28 00:41:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:41:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:41:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-01-28 00:41:48,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-01-28 00:41:48,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-01-28 00:41:48,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-01-28 00:41:48,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:48,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-01-28 00:41:48,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:48,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:48,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:48,668 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 253 flow. Second operand 3 states and 323 transitions. [2023-01-28 00:41:48,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 461 flow [2023-01-28 00:41:48,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:41:48,678 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 239 flow [2023-01-28 00:41:48,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-01-28 00:41:48,681 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-01-28 00:41:48,681 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 239 flow [2023-01-28 00:41:48,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:48,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:48,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:48,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:41:48,682 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:48,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 284755410, now seen corresponding path program 1 times [2023-01-28 00:41:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125361471] [2023-01-28 00:41:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:48,899 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:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125361471] [2023-01-28 00:41:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125361471] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:41:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997649180] [2023-01-28 00:41:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:48,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:41:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:41:48,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:41:48,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-01-28 00:41:48,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 239 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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:48,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:48,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-01-28 00:41:48,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:49,324 INFO L130 PetriNetUnfolder]: 1653/2781 cut-off events. [2023-01-28 00:41:49,325 INFO L131 PetriNetUnfolder]: For 4674/4706 co-relation queries the response was YES. [2023-01-28 00:41:49,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9495 conditions, 2781 events. 1653/2781 cut-off events. For 4674/4706 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15929 event pairs, 328 based on Foata normal form. 52/2809 useless extension candidates. Maximal degree in co-relation 9471. Up to 1442 conditions per place. [2023-01-28 00:41:49,341 INFO L137 encePairwiseOnDemand]: 206/209 looper letters, 49 selfloop transitions, 3 changer transitions 10/65 dead transitions. [2023-01-28 00:41:49,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 504 flow [2023-01-28 00:41:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:41:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:41:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-01-28 00:41:49,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 00:41:49,343 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-01-28 00:41:49,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-01-28 00:41:49,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:49,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-01-28 00:41:49,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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:49,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:49,346 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:49,346 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 239 flow. Second operand 4 states and 418 transitions. [2023-01-28 00:41:49,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 504 flow [2023-01-28 00:41:49,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 478 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 00:41:49,360 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 233 flow [2023-01-28 00:41:49,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-01-28 00:41:49,360 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-28 00:41:49,361 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 233 flow [2023-01-28 00:41:49,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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:49,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:49,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:49,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:41:49,361 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:49,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 705338604, now seen corresponding path program 2 times [2023-01-28 00:41:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647824187] [2023-01-28 00:41:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:49,511 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:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647824187] [2023-01-28 00:41:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647824187] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:49,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:49,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:41:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631664667] [2023-01-28 00:41:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:49,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:41:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:49,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:41:49,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:41:49,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-28 00:41:49,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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:49,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:49,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-28 00:41:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:49,802 INFO L130 PetriNetUnfolder]: 861/1614 cut-off events. [2023-01-28 00:41:49,802 INFO L131 PetriNetUnfolder]: For 1479/1503 co-relation queries the response was YES. [2023-01-28 00:41:49,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5221 conditions, 1614 events. 861/1614 cut-off events. For 1479/1503 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9479 event pairs, 166 based on Foata normal form. 214/1810 useless extension candidates. Maximal degree in co-relation 5197. Up to 652 conditions per place. [2023-01-28 00:41:49,810 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 52 selfloop transitions, 7 changer transitions 34/98 dead transitions. [2023-01-28 00:41:49,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 751 flow [2023-01-28 00:41:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:41:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:41:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2023-01-28 00:41:49,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48883572567783096 [2023-01-28 00:41:49,812 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2023-01-28 00:41:49,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2023-01-28 00:41:49,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:49,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2023-01-28 00:41:49,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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:49,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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:49,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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:49,816 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 233 flow. Second operand 6 states and 613 transitions. [2023-01-28 00:41:49,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 751 flow [2023-01-28 00:41:49,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 737 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:41:49,822 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 261 flow [2023-01-28 00:41:49,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-01-28 00:41:49,824 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-01-28 00:41:49,824 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 261 flow [2023-01-28 00:41:49,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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:49,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:49,825 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:49,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:41:49,825 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:49,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1482863659, now seen corresponding path program 1 times [2023-01-28 00:41:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:49,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145783289] [2023-01-28 00:41:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:50,201 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:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145783289] [2023-01-28 00:41:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145783289] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:41:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371554334] [2023-01-28 00:41:50,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:41:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:41:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:41:50,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-28 00:41:50,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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:50,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:50,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-28 00:41:50,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:50,465 INFO L130 PetriNetUnfolder]: 500/980 cut-off events. [2023-01-28 00:41:50,465 INFO L131 PetriNetUnfolder]: For 1757/1778 co-relation queries the response was YES. [2023-01-28 00:41:50,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 980 events. 500/980 cut-off events. For 1757/1778 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5319 event pairs, 152 based on Foata normal form. 63/1030 useless extension candidates. Maximal degree in co-relation 3597. Up to 358 conditions per place. [2023-01-28 00:41:50,470 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 35 selfloop transitions, 10 changer transitions 32/79 dead transitions. [2023-01-28 00:41:50,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 633 flow [2023-01-28 00:41:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:41:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:41:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-01-28 00:41:50,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730006835269993 [2023-01-28 00:41:50,473 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-01-28 00:41:50,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-01-28 00:41:50,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:50,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-01-28 00:41:50,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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:50,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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:50,477 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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:50,477 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 261 flow. Second operand 7 states and 692 transitions. [2023-01-28 00:41:50,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 633 flow [2023-01-28 00:41:50,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 587 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-01-28 00:41:50,490 INFO L231 Difference]: Finished difference. Result has 58 places, 28 transitions, 176 flow [2023-01-28 00:41:50,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=28} [2023-01-28 00:41:50,491 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-01-28 00:41:50,491 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 28 transitions, 176 flow [2023-01-28 00:41:50,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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:50,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:50,492 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] [2023-01-28 00:41:50,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:41:50,492 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:50,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash 476654974, now seen corresponding path program 1 times [2023-01-28 00:41:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:50,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370877308] [2023-01-28 00:41:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:41:51,419 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:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:41:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370877308] [2023-01-28 00:41:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370877308] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:41:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:41:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:41:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106431971] [2023-01-28 00:41:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:41:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:41:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:41:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:41:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:41:51,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 209 [2023-01-28 00:41:51,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 28 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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:51,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:41:51,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 209 [2023-01-28 00:41:51,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:41:51,702 INFO L130 PetriNetUnfolder]: 140/290 cut-off events. [2023-01-28 00:41:51,702 INFO L131 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2023-01-28 00:41:51,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 290 events. 140/290 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1068 event pairs, 17 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 1024. Up to 165 conditions per place. [2023-01-28 00:41:51,704 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 32 selfloop transitions, 4 changer transitions 22/60 dead transitions. [2023-01-28 00:41:51,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 476 flow [2023-01-28 00:41:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:41:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:41:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-01-28 00:41:51,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45659603554340394 [2023-01-28 00:41:51,707 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-01-28 00:41:51,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-01-28 00:41:51,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:41:51,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-01-28 00:41:51,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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:51,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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:51,711 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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:51,712 INFO L175 Difference]: Start difference. First operand has 58 places, 28 transitions, 176 flow. Second operand 7 states and 668 transitions. [2023-01-28 00:41:51,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 476 flow [2023-01-28 00:41:51,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 360 flow, removed 32 selfloop flow, removed 15 redundant places. [2023-01-28 00:41:51,715 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 126 flow [2023-01-28 00:41:51,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-01-28 00:41:51,715 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-28 00:41:51,716 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 126 flow [2023-01-28 00:41:51,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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:51,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:41:51,716 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] [2023-01-28 00:41:51,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:41:51,716 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:51,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:41:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -811390106, now seen corresponding path program 2 times [2023-01-28 00:41:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:41:51,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649551650] [2023-01-28 00:41:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:41:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:41:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:41:51,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:41:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:41:51,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:41:51,828 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:41:51,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:41:51,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:41:51,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:41:51,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:41:51,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:41:51,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:41:51,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:41:51,833 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:41:51,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:41:51,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:41:51,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:41:51 BasicIcfg [2023-01-28 00:41:51,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:41:51,891 INFO L158 Benchmark]: Toolchain (without parser) took 11942.78ms. Allocated memory was 629.1MB in the beginning and 870.3MB in the end (delta: 241.2MB). Free memory was 576.0MB in the beginning and 370.4MB in the end (delta: 205.7MB). Peak memory consumption was 448.9MB. Max. memory is 16.0GB. [2023-01-28 00:41:51,891 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 314.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:41:51,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.78ms. Allocated memory is still 629.1MB. Free memory was 576.0MB in the beginning and 553.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:41:51,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.32ms. Allocated memory is still 629.1MB. Free memory was 553.0MB in the beginning and 550.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:41:51,892 INFO L158 Benchmark]: Boogie Preprocessor took 45.37ms. Allocated memory is still 629.1MB. Free memory was 550.8MB in the beginning and 548.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:41:51,892 INFO L158 Benchmark]: RCFGBuilder took 601.63ms. Allocated memory is still 629.1MB. Free memory was 548.8MB in the beginning and 511.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 00:41:51,892 INFO L158 Benchmark]: TraceAbstraction took 10678.26ms. Allocated memory was 629.1MB in the beginning and 870.3MB in the end (delta: 241.2MB). Free memory was 510.0MB in the beginning and 370.4MB in the end (delta: 139.6MB). Peak memory consumption was 383.9MB. Max. memory is 16.0GB. [2023-01-28 00:41:51,894 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.12ms. Allocated memory is still 367.0MB. Free memory is still 314.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 538.78ms. Allocated memory is still 629.1MB. Free memory was 576.0MB in the beginning and 553.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.32ms. Allocated memory is still 629.1MB. Free memory was 553.0MB in the beginning and 550.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.37ms. Allocated memory is still 629.1MB. Free memory was 550.8MB in the beginning and 548.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 601.63ms. Allocated memory is still 629.1MB. Free memory was 548.8MB in the beginning and 511.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 10678.26ms. Allocated memory was 629.1MB in the beginning and 870.3MB in the end (delta: 241.2MB). Free memory was 510.0MB in the beginning and 370.4MB in the end (delta: 139.6MB). Peak memory consumption was 383.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 117 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 25 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2392, independent: 2219, independent conditional: 0, independent unconditional: 2219, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1136, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2392, independent: 1124, independent conditional: 0, independent unconditional: 1124, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1136, unknown conditional: 0, unknown unconditional: 1136] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-2, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 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: 10.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 10 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=8, InterpolantAutomatonStates: 46, 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.7s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1008 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:51,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...