/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/mix015.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:37:10,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:37:10,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:37:10,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:37:10,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:37:10,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:37:10,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:37:10,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:37:10,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:37:10,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:37:10,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:37:10,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:37:10,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:37:10,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:37:10,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:37:10,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:37:10,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:37:10,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:37:10,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:37:10,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:37:10,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:37:10,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:37:10,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:37:10,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:37:10,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:37:10,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:37:10,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:37:10,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:37:10,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:37:10,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:37:10,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:37:10,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:37:10,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:37:10,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:37:10,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:37:10,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:37:10,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:37:10,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:37:10,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:37:10,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:37:10,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:37:10,347 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:37:10,372 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:37:10,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:37:10,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:37:10,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:37:10,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:37:10,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:37:10,374 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:37:10,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:37:10,375 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:37:10,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:37:10,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:37:10,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:37:10,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:37:10,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:37:10,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:37:10,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:37:10,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:37:10,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:37:10,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:37:10,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:37:10,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:37:10,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:37:10,377 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:37:10,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:37:10,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:37:10,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:37:10,594 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:37:10,594 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:37:10,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-01-28 00:37:11,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:37:11,814 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:37:11,814 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-01-28 00:37:11,824 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178073918/d5276692d8d743aa8b1a3d78d69f9981/FLAGe1691d00a [2023-01-28 00:37:11,835 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178073918/d5276692d8d743aa8b1a3d78d69f9981 [2023-01-28 00:37:11,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:37:11,837 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:37:11,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:37:11,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:37:11,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:37:11,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:37:11" (1/1) ... [2023-01-28 00:37:11,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ffad11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:11, skipping insertion in model container [2023-01-28 00:37:11,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:37:11" (1/1) ... [2023-01-28 00:37:11,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:37:11,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:37:11,993 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/mix015.oepc.i[945,958] [2023-01-28 00:37:12,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:37:12,168 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:37:12,177 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/mix015.oepc.i[945,958] [2023-01-28 00:37:12,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:37:12,260 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:37:12,261 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:37:12,265 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:37:12,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12 WrapperNode [2023-01-28 00:37:12,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:37:12,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:37:12,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:37:12,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:37:12,271 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:37:12" (1/1) ... [2023-01-28 00:37:12,285 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:37:12" (1/1) ... [2023-01-28 00:37:12,300 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-01-28 00:37:12,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:37:12,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:37:12,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:37:12,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:37:12,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,328 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:37:12,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:37:12,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:37:12,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:37:12,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (1/1) ... [2023-01-28 00:37:12,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:37:12,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:37:12,356 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:37:12,409 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:37:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:37:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:37:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:37:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:37:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:37:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:37:12,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:37:12,438 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:37:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:37:12,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:37:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:37:12,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:37:12,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:37:12,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:37:12,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:37:12,440 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:37:12,556 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:37:12,558 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:37:12,791 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:37:12,873 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:37:12,874 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:37:12,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:37:12 BoogieIcfgContainer [2023-01-28 00:37:12,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:37:12,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:37:12,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:37:12,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:37:12,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:37:11" (1/3) ... [2023-01-28 00:37:12,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2678d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:37:12, skipping insertion in model container [2023-01-28 00:37:12,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:12" (2/3) ... [2023-01-28 00:37:12,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2678d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:37:12, skipping insertion in model container [2023-01-28 00:37:12,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:37:12" (3/3) ... [2023-01-28 00:37:12,880 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-01-28 00:37:12,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:37:12,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:37:12,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:37:12,943 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:37:12,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 00:37:13,000 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 00:37:13,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:37:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 00:37:13,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 00:37:13,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-01-28 00:37:13,013 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:37:13,027 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 00:37:13,032 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 00:37:13,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-01-28 00:37:13,063 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 00:37:13,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:37:13,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 00:37:13,070 INFO L119 LiptonReduction]: Number of co-enabled transitions 2240 [2023-01-28 00:37:15,906 INFO L134 LiptonReduction]: Checked pairs total: 6801 [2023-01-28 00:37:15,906 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-28 00:37:15,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:37:15,920 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;@1f0955c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:37:15,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:37:15,922 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:37:15,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:37:15,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:15,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:37:15,923 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:37:15,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 491380, now seen corresponding path program 1 times [2023-01-28 00:37:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828528508] [2023-01-28 00:37:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:16,245 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:37:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828528508] [2023-01-28 00:37:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828528508] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:16,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:37:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777250442] [2023-01-28 00:37:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:16,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:37:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:37:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:37:16,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 212 [2023-01-28 00:37:16,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:37:16,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:16,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 212 [2023-01-28 00:37:16,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:16,573 INFO L130 PetriNetUnfolder]: 1616/2527 cut-off events. [2023-01-28 00:37:16,573 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-01-28 00:37:16,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 2527 events. 1616/2527 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14075 event pairs, 204 based on Foata normal form. 100/2420 useless extension candidates. Maximal degree in co-relation 4940. Up to 2013 conditions per place. [2023-01-28 00:37:16,584 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-01-28 00:37:16,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 181 flow [2023-01-28 00:37:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:37:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:37:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-01-28 00:37:16,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5440251572327044 [2023-01-28 00:37:16,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-01-28 00:37:16,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-01-28 00:37:16,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:16,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-01-28 00:37:16,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:37:16,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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:37:16,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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:37:16,603 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 346 transitions. [2023-01-28 00:37:16,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 181 flow [2023-01-28 00:37:16,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:37:16,606 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-01-28 00:37:16,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 00:37:16,609 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-01-28 00:37:16,609 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-01-28 00:37:16,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:37:16,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:16,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:16,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:37:16,610 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:37:16,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash -585120088, now seen corresponding path program 1 times [2023-01-28 00:37:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300517219] [2023-01-28 00:37:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:16,793 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:37:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300517219] [2023-01-28 00:37:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300517219] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:37:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754932555] [2023-01-28 00:37:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:16,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:37:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:16,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:37:16,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:37:16,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-28 00:37:16,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 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:37:16,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:16,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-28 00:37:16,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:17,124 INFO L130 PetriNetUnfolder]: 2373/3510 cut-off events. [2023-01-28 00:37:17,124 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2023-01-28 00:37:17,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7282 conditions, 3510 events. 2373/3510 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15994 event pairs, 1229 based on Foata normal form. 180/3690 useless extension candidates. Maximal degree in co-relation 7272. Up to 2983 conditions per place. [2023-01-28 00:37:17,136 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2023-01-28 00:37:17,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2023-01-28 00:37:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-01-28 00:37:17,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.480188679245283 [2023-01-28 00:37:17,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-01-28 00:37:17,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-01-28 00:37:17,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:17,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-01-28 00:37:17,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 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:37:17,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:17,146 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:17,146 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 509 transitions. [2023-01-28 00:37:17,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2023-01-28 00:37:17,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:17,147 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2023-01-28 00:37:17,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-01-28 00:37:17,148 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-01-28 00:37:17,148 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2023-01-28 00:37:17,148 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:37:17,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:17,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:17,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:37:17,149 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:37:17,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1128493786, now seen corresponding path program 1 times [2023-01-28 00:37:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160987217] [2023-01-28 00:37:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:17,354 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:37:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160987217] [2023-01-28 00:37:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160987217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:17,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:17,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:37:17,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153233510] [2023-01-28 00:37:17,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:17,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:17,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:17,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:17,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:17,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-28 00:37:17,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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:37:17,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:17,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-28 00:37:17,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:17,641 INFO L130 PetriNetUnfolder]: 2105/3114 cut-off events. [2023-01-28 00:37:17,642 INFO L131 PetriNetUnfolder]: For 1470/1470 co-relation queries the response was YES. [2023-01-28 00:37:17,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7657 conditions, 3114 events. 2105/3114 cut-off events. For 1470/1470 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13637 event pairs, 589 based on Foata normal form. 156/3270 useless extension candidates. Maximal degree in co-relation 7644. Up to 2001 conditions per place. [2023-01-28 00:37:17,656 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 35 selfloop transitions, 3 changer transitions 24/62 dead transitions. [2023-01-28 00:37:17,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 314 flow [2023-01-28 00:37:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-28 00:37:17,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820754716981132 [2023-01-28 00:37:17,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-28 00:37:17,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-28 00:37:17,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:17,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-28 00:37:17,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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:37:17,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:17,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:17,662 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 5 states and 511 transitions. [2023-01-28 00:37:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 314 flow [2023-01-28 00:37:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:17,672 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2023-01-28 00:37:17,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-01-28 00:37:17,673 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2023-01-28 00:37:17,675 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2023-01-28 00:37:17,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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:37:17,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:17,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:17,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:37:17,676 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:37:17,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 414373183, now seen corresponding path program 1 times [2023-01-28 00:37:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484192997] [2023-01-28 00:37:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:17,828 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:37:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484192997] [2023-01-28 00:37:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484192997] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:37:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297812010] [2023-01-28 00:37:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:17,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-28 00:37:17,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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:37:17,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:17,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-28 00:37:17,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:18,057 INFO L130 PetriNetUnfolder]: 1835/2728 cut-off events. [2023-01-28 00:37:18,058 INFO L131 PetriNetUnfolder]: For 2087/2087 co-relation queries the response was YES. [2023-01-28 00:37:18,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6930 conditions, 2728 events. 1835/2728 cut-off events. For 2087/2087 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11736 event pairs, 1061 based on Foata normal form. 120/2848 useless extension candidates. Maximal degree in co-relation 6914. Up to 1845 conditions per place. [2023-01-28 00:37:18,068 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 39 selfloop transitions, 3 changer transitions 20/62 dead transitions. [2023-01-28 00:37:18,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 324 flow [2023-01-28 00:37:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-28 00:37:18,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820754716981132 [2023-01-28 00:37:18,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-28 00:37:18,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-28 00:37:18,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:18,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-28 00:37:18,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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:37:18,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:18,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:18,073 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 511 transitions. [2023-01-28 00:37:18,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 324 flow [2023-01-28 00:37:18,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 312 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:37:18,079 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2023-01-28 00:37:18,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-01-28 00:37:18,080 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 00:37:18,080 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2023-01-28 00:37:18,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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:37:18,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:18,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:18,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:37:18,081 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:37:18,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 116505641, now seen corresponding path program 1 times [2023-01-28 00:37:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:18,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988062736] [2023-01-28 00:37:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:18,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:37:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:18,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988062736] [2023-01-28 00:37:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988062736] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:18,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:18,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:37:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121089362] [2023-01-28 00:37:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:18,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:37:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:18,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:37:18,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:37:18,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-01-28 00:37:18,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:37:18,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:18,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-01-28 00:37:18,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:18,306 INFO L130 PetriNetUnfolder]: 599/1007 cut-off events. [2023-01-28 00:37:18,306 INFO L131 PetriNetUnfolder]: For 662/673 co-relation queries the response was YES. [2023-01-28 00:37:18,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 1007 events. 599/1007 cut-off events. For 662/673 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4599 event pairs, 164 based on Foata normal form. 62/1049 useless extension candidates. Maximal degree in co-relation 2578. Up to 747 conditions per place. [2023-01-28 00:37:18,310 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-01-28 00:37:18,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 219 flow [2023-01-28 00:37:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:37:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:37:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-01-28 00:37:18,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157232704402516 [2023-01-28 00:37:18,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-01-28 00:37:18,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-01-28 00:37:18,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:18,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-01-28 00:37:18,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:37:18,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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:37:18,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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:37:18,313 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 3 states and 328 transitions. [2023-01-28 00:37:18,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 219 flow [2023-01-28 00:37:18,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 207 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:37:18,315 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 120 flow [2023-01-28 00:37:18,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-01-28 00:37:18,316 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-01-28 00:37:18,316 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 120 flow [2023-01-28 00:37:18,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:37:18,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:18,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:18,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:37:18,317 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:37:18,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash 308684934, now seen corresponding path program 1 times [2023-01-28 00:37:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:18,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530011600] [2023-01-28 00:37:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:18,434 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:37:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530011600] [2023-01-28 00:37:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530011600] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:18,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:37:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905522239] [2023-01-28 00:37:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:18,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:37:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:37:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:37:18,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-01-28 00:37:18,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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:37:18,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:18,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-01-28 00:37:18,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:18,532 INFO L130 PetriNetUnfolder]: 299/553 cut-off events. [2023-01-28 00:37:18,533 INFO L131 PetriNetUnfolder]: For 208/212 co-relation queries the response was YES. [2023-01-28 00:37:18,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 553 events. 299/553 cut-off events. For 208/212 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2339 event pairs, 106 based on Foata normal form. 51/594 useless extension candidates. Maximal degree in co-relation 1549. Up to 218 conditions per place. [2023-01-28 00:37:18,535 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-01-28 00:37:18,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2023-01-28 00:37:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:37:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:37:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-01-28 00:37:18,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165094339622641 [2023-01-28 00:37:18,536 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-01-28 00:37:18,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-01-28 00:37:18,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:18,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-01-28 00:37:18,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:37:18,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 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:37:18,539 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 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:37:18,539 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 120 flow. Second operand 4 states and 438 transitions. [2023-01-28 00:37:18,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2023-01-28 00:37:18,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:37:18,540 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 156 flow [2023-01-28 00:37:18,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-01-28 00:37:18,541 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 00:37:18,541 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 156 flow [2023-01-28 00:37:18,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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:37:18,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:18,541 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] [2023-01-28 00:37:18,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:37:18,541 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:37:18,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1803191772, now seen corresponding path program 1 times [2023-01-28 00:37:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123273883] [2023-01-28 00:37:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:18,852 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:37:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:18,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123273883] [2023-01-28 00:37:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123273883] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:18,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:37:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756308272] [2023-01-28 00:37:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:18,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:37:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:18,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:37:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:37:18,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-01-28 00:37:18,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 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:37:18,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:18,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-01-28 00:37:18,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:19,067 INFO L130 PetriNetUnfolder]: 453/897 cut-off events. [2023-01-28 00:37:19,067 INFO L131 PetriNetUnfolder]: For 923/933 co-relation queries the response was YES. [2023-01-28 00:37:19,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 897 events. 453/897 cut-off events. For 923/933 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4616 event pairs, 104 based on Foata normal form. 13/902 useless extension candidates. Maximal degree in co-relation 2733. Up to 412 conditions per place. [2023-01-28 00:37:19,071 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 68 selfloop transitions, 11 changer transitions 20/104 dead transitions. [2023-01-28 00:37:19,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 683 flow [2023-01-28 00:37:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:37:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:37:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2023-01-28 00:37:19,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2023-01-28 00:37:19,073 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2023-01-28 00:37:19,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2023-01-28 00:37:19,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:19,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2023-01-28 00:37:19,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 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:37:19,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:37:19,076 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:37:19,076 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 156 flow. Second operand 7 states and 735 transitions. [2023-01-28 00:37:19,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 683 flow [2023-01-28 00:37:19,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 104 transitions, 629 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:19,078 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 216 flow [2023-01-28 00:37:19,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-01-28 00:37:19,079 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-01-28 00:37:19,079 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 216 flow [2023-01-28 00:37:19,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 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:37:19,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:19,079 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] [2023-01-28 00:37:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:37:19,080 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:37:19,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1854376428, now seen corresponding path program 2 times [2023-01-28 00:37:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572872516] [2023-01-28 00:37:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:19,328 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:37:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572872516] [2023-01-28 00:37:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572872516] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:37:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659138511] [2023-01-28 00:37:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:19,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:19,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-01-28 00:37:19,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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:37:19,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:19,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-01-28 00:37:19,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:19,444 INFO L130 PetriNetUnfolder]: 380/727 cut-off events. [2023-01-28 00:37:19,444 INFO L131 PetriNetUnfolder]: For 828/832 co-relation queries the response was YES. [2023-01-28 00:37:19,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 727 events. 380/727 cut-off events. For 828/832 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3584 event pairs, 95 based on Foata normal form. 31/749 useless extension candidates. Maximal degree in co-relation 2462. Up to 285 conditions per place. [2023-01-28 00:37:19,447 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 56 selfloop transitions, 10 changer transitions 6/77 dead transitions. [2023-01-28 00:37:19,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 508 flow [2023-01-28 00:37:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-01-28 00:37:19,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047169811320755 [2023-01-28 00:37:19,449 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-01-28 00:37:19,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-01-28 00:37:19,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:19,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-01-28 00:37:19,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:37:19,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:19,451 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:19,451 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 216 flow. Second operand 5 states and 535 transitions. [2023-01-28 00:37:19,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 508 flow [2023-01-28 00:37:19,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 480 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-28 00:37:19,454 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 207 flow [2023-01-28 00:37:19,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-01-28 00:37:19,456 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-01-28 00:37:19,456 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 207 flow [2023-01-28 00:37:19,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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:37:19,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:19,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:19,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:37:19,457 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:37:19,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1224664419, now seen corresponding path program 1 times [2023-01-28 00:37:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226860863] [2023-01-28 00:37:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:19,929 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:37:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226860863] [2023-01-28 00:37:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226860863] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 00:37:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321480061] [2023-01-28 00:37:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:19,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 00:37:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 00:37:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-01-28 00:37:19,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 212 [2023-01-28 00:37:19,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 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:37:19,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:19,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 212 [2023-01-28 00:37:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:20,298 INFO L130 PetriNetUnfolder]: 681/1227 cut-off events. [2023-01-28 00:37:20,298 INFO L131 PetriNetUnfolder]: For 2116/2116 co-relation queries the response was YES. [2023-01-28 00:37:20,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1227 events. 681/1227 cut-off events. For 2116/2116 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6097 event pairs, 87 based on Foata normal form. 1/1228 useless extension candidates. Maximal degree in co-relation 4448. Up to 397 conditions per place. [2023-01-28 00:37:20,304 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 111 selfloop transitions, 28 changer transitions 9/148 dead transitions. [2023-01-28 00:37:20,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 148 transitions, 1090 flow [2023-01-28 00:37:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 00:37:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 00:37:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1127 transitions. [2023-01-28 00:37:20,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4430031446540881 [2023-01-28 00:37:20,308 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1127 transitions. [2023-01-28 00:37:20,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1127 transitions. [2023-01-28 00:37:20,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:20,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1127 transitions. [2023-01-28 00:37:20,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 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:37:20,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 212.0) internal successors, (2756), 13 states have internal predecessors, (2756), 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:37:20,314 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 212.0) internal successors, (2756), 13 states have internal predecessors, (2756), 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:37:20,314 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 207 flow. Second operand 12 states and 1127 transitions. [2023-01-28 00:37:20,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 148 transitions, 1090 flow [2023-01-28 00:37:20,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 148 transitions, 940 flow, removed 41 selfloop flow, removed 5 redundant places. [2023-01-28 00:37:20,321 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 381 flow [2023-01-28 00:37:20,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=381, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-01-28 00:37:20,322 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-01-28 00:37:20,322 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 381 flow [2023-01-28 00:37:20,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 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:37:20,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:20,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:37:20,323 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:37:20,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1258688055, now seen corresponding path program 2 times [2023-01-28 00:37:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927031545] [2023-01-28 00:37:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:20,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:20,593 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:37:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927031545] [2023-01-28 00:37:20,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927031545] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:20,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:20,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:37:20,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734080624] [2023-01-28 00:37:20,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:20,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:37:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:37:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:37:20,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-01-28 00:37:20,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 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:37:20,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:20,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-01-28 00:37:20,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:20,834 INFO L130 PetriNetUnfolder]: 871/1589 cut-off events. [2023-01-28 00:37:20,834 INFO L131 PetriNetUnfolder]: For 3394/3394 co-relation queries the response was YES. [2023-01-28 00:37:20,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 1589 events. 871/1589 cut-off events. For 3394/3394 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8502 event pairs, 144 based on Foata normal form. 2/1591 useless extension candidates. Maximal degree in co-relation 6384. Up to 719 conditions per place. [2023-01-28 00:37:20,846 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 56 selfloop transitions, 6 changer transitions 49/111 dead transitions. [2023-01-28 00:37:20,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 889 flow [2023-01-28 00:37:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:37:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:37:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-01-28 00:37:20,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568733153638814 [2023-01-28 00:37:20,848 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-01-28 00:37:20,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-01-28 00:37:20,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:20,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-01-28 00:37:20,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 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:37:20,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:37:20,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:37:20,851 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 381 flow. Second operand 7 states and 678 transitions. [2023-01-28 00:37:20,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 889 flow [2023-01-28 00:37:20,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 884 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:20,863 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 291 flow [2023-01-28 00:37:20,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-01-28 00:37:20,865 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2023-01-28 00:37:20,865 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 291 flow [2023-01-28 00:37:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 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:37:20,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:20,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:37:20,866 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:37:20,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1243169375, now seen corresponding path program 3 times [2023-01-28 00:37:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529956241] [2023-01-28 00:37:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:21,058 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:37:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529956241] [2023-01-28 00:37:21,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529956241] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:21,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:21,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:37:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558618628] [2023-01-28 00:37:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:21,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:21,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-01-28 00:37:21,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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:37:21,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:21,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-01-28 00:37:21,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:21,210 INFO L130 PetriNetUnfolder]: 499/1014 cut-off events. [2023-01-28 00:37:21,210 INFO L131 PetriNetUnfolder]: For 2419/2438 co-relation queries the response was YES. [2023-01-28 00:37:21,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4073 conditions, 1014 events. 499/1014 cut-off events. For 2419/2438 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5502 event pairs, 129 based on Foata normal form. 3/1014 useless extension candidates. Maximal degree in co-relation 4044. Up to 492 conditions per place. [2023-01-28 00:37:21,214 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 38 selfloop transitions, 1 changer transitions 48/89 dead transitions. [2023-01-28 00:37:21,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 736 flow [2023-01-28 00:37:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-01-28 00:37:21,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49245283018867925 [2023-01-28 00:37:21,215 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-01-28 00:37:21,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-01-28 00:37:21,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:21,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-01-28 00:37:21,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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:37:21,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:21,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:37:21,218 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 291 flow. Second operand 5 states and 522 transitions. [2023-01-28 00:37:21,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 736 flow [2023-01-28 00:37:21,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 698 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-01-28 00:37:21,224 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 212 flow [2023-01-28 00:37:21,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2023-01-28 00:37:21,225 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2023-01-28 00:37:21,225 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 212 flow [2023-01-28 00:37:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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:37:21,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:21,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:21,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:37:21,225 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:37:21,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1002616571, now seen corresponding path program 4 times [2023-01-28 00:37:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:21,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249431927] [2023-01-28 00:37:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:21,861 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:37:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249431927] [2023-01-28 00:37:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249431927] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:37:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521473115] [2023-01-28 00:37:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:21,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:37:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:37:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:37:21,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 212 [2023-01-28 00:37:21,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 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:37:21,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:21,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 212 [2023-01-28 00:37:21,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:22,116 INFO L130 PetriNetUnfolder]: 279/594 cut-off events. [2023-01-28 00:37:22,117 INFO L131 PetriNetUnfolder]: For 1149/1149 co-relation queries the response was YES. [2023-01-28 00:37:22,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 594 events. 279/594 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2721 event pairs, 71 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 2354. Up to 222 conditions per place. [2023-01-28 00:37:22,119 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 59 selfloop transitions, 6 changer transitions 26/91 dead transitions. [2023-01-28 00:37:22,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 664 flow [2023-01-28 00:37:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:37:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:37:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 732 transitions. [2023-01-28 00:37:22,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43160377358490565 [2023-01-28 00:37:22,121 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 732 transitions. [2023-01-28 00:37:22,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 732 transitions. [2023-01-28 00:37:22,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:22,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 732 transitions. [2023-01-28 00:37:22,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 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:37:22,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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:37:22,124 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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:37:22,124 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 212 flow. Second operand 8 states and 732 transitions. [2023-01-28 00:37:22,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 664 flow [2023-01-28 00:37:22,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 612 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-01-28 00:37:22,127 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 213 flow [2023-01-28 00:37:22,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-01-28 00:37:22,128 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2023-01-28 00:37:22,128 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 213 flow [2023-01-28 00:37:22,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 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:37:22,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:22,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:22,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:37:22,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:37:22,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 462935021, now seen corresponding path program 5 times [2023-01-28 00:37:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089701495] [2023-01-28 00:37:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:37:22,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:37:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:37:22,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:37:22,218 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:37:22,218 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:37:22,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:37:22,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:37:22,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:37:22,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:37:22,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:37:22,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:37:22,221 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:22,224 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:37:22,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:37:22,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:37:22 BasicIcfg [2023-01-28 00:37:22,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:37:22,283 INFO L158 Benchmark]: Toolchain (without parser) took 10445.69ms. Allocated memory was 606.1MB in the beginning and 874.5MB in the end (delta: 268.4MB). Free memory was 548.2MB in the beginning and 560.5MB in the end (delta: -12.3MB). Peak memory consumption was 259.0MB. Max. memory is 16.0GB. [2023-01-28 00:37:22,283 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory is still 320.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:37:22,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.65ms. Allocated memory is still 606.1MB. Free memory was 548.2MB in the beginning and 524.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:37:22,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.95ms. Allocated memory is still 606.1MB. Free memory was 524.9MB in the beginning and 522.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:37:22,284 INFO L158 Benchmark]: Boogie Preprocessor took 30.16ms. Allocated memory is still 606.1MB. Free memory was 522.3MB in the beginning and 520.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:37:22,284 INFO L158 Benchmark]: RCFGBuilder took 543.81ms. Allocated memory is still 606.1MB. Free memory was 520.2MB in the beginning and 559.8MB in the end (delta: -39.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.0GB. [2023-01-28 00:37:22,284 INFO L158 Benchmark]: TraceAbstraction took 9406.41ms. Allocated memory was 606.1MB in the beginning and 874.5MB in the end (delta: 268.4MB). Free memory was 558.7MB in the beginning and 560.5MB in the end (delta: -1.7MB). Peak memory consumption was 266.7MB. Max. memory is 16.0GB. [2023-01-28 00:37:22,289 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.11ms. Allocated memory is still 377.5MB. Free memory is still 320.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 427.65ms. Allocated memory is still 606.1MB. Free memory was 548.2MB in the beginning and 524.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.95ms. Allocated memory is still 606.1MB. Free memory was 524.9MB in the beginning and 522.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.16ms. Allocated memory is still 606.1MB. Free memory was 522.3MB in the beginning and 520.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 543.81ms. Allocated memory is still 606.1MB. Free memory was 520.2MB in the beginning and 559.8MB in the end (delta: -39.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.0GB. * TraceAbstraction took 9406.41ms. Allocated memory was 606.1MB in the beginning and 874.5MB in the end (delta: 268.4MB). Free memory was 558.7MB in the beginning and 560.5MB in the end (delta: -1.7MB). Peak memory consumption was 266.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 120 PlacesBefore, 37 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 6801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3490, independent: 3270, independent conditional: 0, independent unconditional: 3270, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1227, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3490, independent: 2077, independent conditional: 0, independent unconditional: 2077, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1227, unknown conditional: 0, unknown unconditional: 1227] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t385, ((void *)0), P0, ((void *)0))=-3, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t386, ((void *)0), P1, ((void *)0))=-2, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t387, ((void *)0), P2, ((void *)0))=-1, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y=1, z=1] [L828] 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) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 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 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 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_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y=1, z=1] [L772] 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) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 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 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 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_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L792] 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) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 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 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 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_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 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 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 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_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 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_p0_EAX=1, __unbuffered_p0_EBX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, 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: 853]: 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: 855]: 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: 851]: 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, 145 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: 9.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1591 IncrementalHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 31 mSDtfsCounter, 1591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:37:22,307 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...