./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:13:10,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:13:10,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:13:10,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:13:10,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:13:10,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:13:10,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:13:10,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:13:10,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:13:10,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:13:10,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:13:10,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:13:10,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:13:10,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:13:10,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:13:11,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:13:11,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:13:11,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:13:11,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:13:11,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:13:11,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:13:11,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:13:11,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:13:11,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:13:11,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:13:11,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:13:11,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:13:11,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:13:11,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:13:11,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:13:11,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:13:11,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:13:11,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:13:11,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:13:11,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:13:11,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:13:11,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:13:11,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:13:11,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:13:11,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:13:11,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:13:11,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:13:11,069 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:13:11,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:13:11,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:13:11,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:13:11,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:13:11,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:13:11,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:13:11,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:13:11,073 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:13:11,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:13:11,074 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:13:11,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:13:11,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:13:11,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:13:11,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:13:11,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:13:11,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:13:11,075 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:13:11,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:13:11,076 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:13:11,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:13:11,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:13:11,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:13:11,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:13:11,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:13:11,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:13:11,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:13:11,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:13:11,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:13:11,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:13:11,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:13:11,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:13:11,079 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:13:11,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:13:11,079 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:13:11,079 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef 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 -> TOGETHER [2023-08-30 23:13:11,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:13:11,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:13:11,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:13:11,422 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:13:11,422 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:13:11,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2023-08-30 23:13:12,691 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:13:12,984 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:13:12,984 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2023-08-30 23:13:13,006 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb5494c9/5483aca585f8445b8968dc0d0b2688d1/FLAG47256a7ac [2023-08-30 23:13:13,024 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb5494c9/5483aca585f8445b8968dc0d0b2688d1 [2023-08-30 23:13:13,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:13:13,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:13:13,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:13:13,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:13:13,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:13:13,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611a6bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13, skipping insertion in model container [2023-08-30 23:13:13,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:13:13,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:13:13,261 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/mix037.opt.i[944,957] [2023-08-30 23:13:13,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:13:13,477 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:13:13,487 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/mix037.opt.i[944,957] [2023-08-30 23:13:13,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:13:13,583 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:13:13,584 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:13:13,589 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:13:13,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13 WrapperNode [2023-08-30 23:13:13,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:13:13,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:13:13,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:13:13,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:13:13,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,636 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-30 23:13:13,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:13:13,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:13:13,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:13:13,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:13:13,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:13:13,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:13:13,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:13:13,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:13:13,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (1/1) ... [2023-08-30 23:13:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:13:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:13:13,722 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-08-30 23:13:13,747 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-08-30 23:13:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:13:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:13:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:13:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:13:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:13:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:13:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:13:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:13:13,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:13:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:13:13,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:13:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:13:13,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:13:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:13:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:13:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:13:13,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:13:13,764 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:13:13,954 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:13:13,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:13:14,208 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:13:14,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:13:14,371 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:13:14,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:14 BoogieIcfgContainer [2023-08-30 23:13:14,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:13:14,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:13:14,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:13:14,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:13:14,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:13:13" (1/3) ... [2023-08-30 23:13:14,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d352af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:13:14, skipping insertion in model container [2023-08-30 23:13:14,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:13" (2/3) ... [2023-08-30 23:13:14,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d352af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:13:14, skipping insertion in model container [2023-08-30 23:13:14,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:14" (3/3) ... [2023-08-30 23:13:14,383 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-08-30 23:13:14,390 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:13:14,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:13:14,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:13:14,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:13:14,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:13:14,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 23:13:14,567 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 23:13:14,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:14,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 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/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 23:13:14,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 23:13:14,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-30 23:13:14,580 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:13:14,591 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 23:13:14,594 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 23:13:14,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-30 23:13:14,620 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 23:13:14,620 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:14,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 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/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 23:13:14,623 INFO L119 LiptonReduction]: Number of co-enabled transitions 2816 [2023-08-30 23:13:18,738 INFO L134 LiptonReduction]: Checked pairs total: 6492 [2023-08-30 23:13:18,738 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 23:13:18,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:13:18,764 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=true, 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;@645f41ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:13:18,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:13:18,782 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 23:13:18,784 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:18,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:18,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:18,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:18,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash -656996611, now seen corresponding path program 1 times [2023-08-30 23:13:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54983443] [2023-08-30 23:13:18,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54983443] [2023-08-30 23:13:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54983443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:13:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344079783] [2023-08-30 23:13:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:13:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:13:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:13:19,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-30 23:13:19,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-08-30 23:13:19,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:19,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-30 23:13:19,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:19,832 INFO L130 PetriNetUnfolder]: 2594/3779 cut-off events. [2023-08-30 23:13:19,833 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-30 23:13:19,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 3779 events. 2594/3779 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19592 event pairs, 518 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 7462. Up to 2797 conditions per place. [2023-08-30 23:13:19,857 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-30 23:13:19,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-08-30 23:13:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:13:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:13:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 23:13:19,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2023-08-30 23:13:19,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 23:13:19,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 23:13:19,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:19,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 23:13:19,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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-08-30 23:13:19,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-08-30 23:13:19,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-08-30 23:13:19,895 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 388 transitions. [2023-08-30 23:13:19,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-08-30 23:13:19,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:13:19,902 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-08-30 23:13:19,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 23:13:19,908 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-30 23:13:19,909 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-08-30 23:13:19,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-08-30 23:13:19,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:19,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:19,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:13:19,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:19,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash -13465944, now seen corresponding path program 1 times [2023-08-30 23:13:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964171232] [2023-08-30 23:13:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964171232] [2023-08-30 23:13:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964171232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:13:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891665881] [2023-08-30 23:13:20,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:20,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:13:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:20,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:13:20,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:13:20,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 23:13:20,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:20,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:20,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 23:13:20,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:21,149 INFO L130 PetriNetUnfolder]: 6453/8946 cut-off events. [2023-08-30 23:13:21,150 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2023-08-30 23:13:21,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18494 conditions, 8946 events. 6453/8946 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 43452 event pairs, 2293 based on Foata normal form. 200/9146 useless extension candidates. Maximal degree in co-relation 18484. Up to 6549 conditions per place. [2023-08-30 23:13:21,202 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-30 23:13:21,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-30 23:13:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:13:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:13:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-30 23:13:21,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509641873278237 [2023-08-30 23:13:21,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-30 23:13:21,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-30 23:13:21,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:21,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-30 23:13:21,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 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-08-30 23:13:21,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-08-30 23:13:21,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-08-30 23:13:21,208 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 370 transitions. [2023-08-30 23:13:21,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-30 23:13:21,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:21,215 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 112 flow [2023-08-30 23:13:21,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-30 23:13:21,216 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-30 23:13:21,216 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 112 flow [2023-08-30 23:13:21,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:21,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:21,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:21,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:13:21,217 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:21,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash -417446566, now seen corresponding path program 1 times [2023-08-30 23:13:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77943492] [2023-08-30 23:13:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:21,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77943492] [2023-08-30 23:13:21,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77943492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:21,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:13:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029819529] [2023-08-30 23:13:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:21,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:21,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:21,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:21,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 23:13:21,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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-08-30 23:13:21,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:21,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 23:13:21,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:22,200 INFO L130 PetriNetUnfolder]: 5989/8314 cut-off events. [2023-08-30 23:13:22,200 INFO L131 PetriNetUnfolder]: For 3378/3378 co-relation queries the response was YES. [2023-08-30 23:13:22,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21128 conditions, 8314 events. 5989/8314 cut-off events. For 3378/3378 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 38643 event pairs, 1725 based on Foata normal form. 112/8426 useless extension candidates. Maximal degree in co-relation 21116. Up to 4373 conditions per place. [2023-08-30 23:13:22,263 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-30 23:13:22,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 284 flow [2023-08-30 23:13:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:13:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:13:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-30 23:13:22,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2023-08-30 23:13:22,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-30 23:13:22,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-30 23:13:22,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:22,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-30 23:13:22,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 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-08-30 23:13:22,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:22,270 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:22,270 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 112 flow. Second operand 4 states and 481 transitions. [2023-08-30 23:13:22,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 284 flow [2023-08-30 23:13:22,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:22,292 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 156 flow [2023-08-30 23:13:22,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, 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=35} [2023-08-30 23:13:22,293 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-30 23:13:22,294 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 156 flow [2023-08-30 23:13:22,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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-08-30 23:13:22,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:22,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:22,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:13:22,295 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:22,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash -121816418, now seen corresponding path program 1 times [2023-08-30 23:13:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128508329] [2023-08-30 23:13:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:22,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128508329] [2023-08-30 23:13:22,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128508329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:22,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:22,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:13:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150048903] [2023-08-30 23:13:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:22,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:13:22,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:22,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:13:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:13:22,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-08-30 23:13:22,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-08-30 23:13:22,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:22,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-08-30 23:13:22,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:23,269 INFO L130 PetriNetUnfolder]: 4969/7223 cut-off events. [2023-08-30 23:13:23,270 INFO L131 PetriNetUnfolder]: For 4921/4925 co-relation queries the response was YES. [2023-08-30 23:13:23,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18797 conditions, 7223 events. 4969/7223 cut-off events. For 4921/4925 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 37393 event pairs, 2062 based on Foata normal form. 32/7222 useless extension candidates. Maximal degree in co-relation 18782. Up to 6234 conditions per place. [2023-08-30 23:13:23,318 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 46 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-08-30 23:13:23,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 344 flow [2023-08-30 23:13:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:13:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:13:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-30 23:13:23,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2023-08-30 23:13:23,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-30 23:13:23,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-30 23:13:23,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:23,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-30 23:13:23,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-08-30 23:13:23,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-08-30 23:13:23,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-08-30 23:13:23,326 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 156 flow. Second operand 3 states and 387 transitions. [2023-08-30 23:13:23,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 344 flow [2023-08-30 23:13:23,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:13:23,337 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 205 flow [2023-08-30 23:13:23,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-30 23:13:23,339 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-30 23:13:23,339 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 205 flow [2023-08-30 23:13:23,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-08-30 23:13:23,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:23,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:23,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:13:23,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:23,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 518619766, now seen corresponding path program 1 times [2023-08-30 23:13:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684244351] [2023-08-30 23:13:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684244351] [2023-08-30 23:13:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684244351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019974886] [2023-08-30 23:13:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:23,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:23,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 23:13:23,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 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-08-30 23:13:23,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:23,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 23:13:23,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:24,258 INFO L130 PetriNetUnfolder]: 4104/6066 cut-off events. [2023-08-30 23:13:24,259 INFO L131 PetriNetUnfolder]: For 5501/5882 co-relation queries the response was YES. [2023-08-30 23:13:24,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16494 conditions, 6066 events. 4104/6066 cut-off events. For 5501/5882 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 34392 event pairs, 778 based on Foata normal form. 573/6347 useless extension candidates. Maximal degree in co-relation 16477. Up to 4004 conditions per place. [2023-08-30 23:13:24,301 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 78 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2023-08-30 23:13:24,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 98 transitions, 641 flow [2023-08-30 23:13:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-30 23:13:24,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515702479338843 [2023-08-30 23:13:24,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-30 23:13:24,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-30 23:13:24,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:24,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-30 23:13:24,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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-08-30 23:13:24,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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-08-30 23:13:24,308 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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-08-30 23:13:24,308 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 205 flow. Second operand 5 states and 624 transitions. [2023-08-30 23:13:24,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 98 transitions, 641 flow [2023-08-30 23:13:24,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:13:24,316 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 274 flow [2023-08-30 23:13:24,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-30 23:13:24,318 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-30 23:13:24,318 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 274 flow [2023-08-30 23:13:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 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-08-30 23:13:24,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:24,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:13:24,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:24,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2074757085, now seen corresponding path program 1 times [2023-08-30 23:13:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988386406] [2023-08-30 23:13:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988386406] [2023-08-30 23:13:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988386406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59150091] [2023-08-30 23:13:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:24,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:24,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 23:13:24,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-08-30 23:13:24,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:24,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 23:13:24,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:25,612 INFO L130 PetriNetUnfolder]: 6464/9409 cut-off events. [2023-08-30 23:13:25,612 INFO L131 PetriNetUnfolder]: For 13778/13778 co-relation queries the response was YES. [2023-08-30 23:13:25,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33538 conditions, 9409 events. 6464/9409 cut-off events. For 13778/13778 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 50788 event pairs, 1840 based on Foata normal form. 101/9510 useless extension candidates. Maximal degree in co-relation 33517. Up to 4785 conditions per place. [2023-08-30 23:13:25,663 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 61 selfloop transitions, 11 changer transitions 14/86 dead transitions. [2023-08-30 23:13:25,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 610 flow [2023-08-30 23:13:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:13:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:13:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-08-30 23:13:25,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506198347107438 [2023-08-30 23:13:25,665 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-08-30 23:13:25,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-08-30 23:13:25,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:25,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-08-30 23:13:25,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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-08-30 23:13:25,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:25,670 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:25,670 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 274 flow. Second operand 4 states and 490 transitions. [2023-08-30 23:13:25,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 610 flow [2023-08-30 23:13:25,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:13:25,690 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 278 flow [2023-08-30 23:13:25,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 23:13:25,691 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-30 23:13:25,691 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 278 flow [2023-08-30 23:13:25,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-08-30 23:13:25,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:25,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:25,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:13:25,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:25,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -241610471, now seen corresponding path program 1 times [2023-08-30 23:13:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314395120] [2023-08-30 23:13:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:25,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:25,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314395120] [2023-08-30 23:13:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314395120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:13:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6707794] [2023-08-30 23:13:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:25,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:13:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:13:25,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:13:25,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 23:13:25,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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-08-30 23:13:25,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:25,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 23:13:25,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:26,507 INFO L130 PetriNetUnfolder]: 2410/3830 cut-off events. [2023-08-30 23:13:26,508 INFO L131 PetriNetUnfolder]: For 6004/6240 co-relation queries the response was YES. [2023-08-30 23:13:26,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13530 conditions, 3830 events. 2410/3830 cut-off events. For 6004/6240 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22139 event pairs, 312 based on Foata normal form. 464/4172 useless extension candidates. Maximal degree in co-relation 13506. Up to 1654 conditions per place. [2023-08-30 23:13:26,538 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 94 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-08-30 23:13:26,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 116 transitions, 908 flow [2023-08-30 23:13:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:13:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:13:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-30 23:13:26,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172176308539945 [2023-08-30 23:13:26,541 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-30 23:13:26,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-30 23:13:26,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:26,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-30 23:13:26,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 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-08-30 23:13:26,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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-08-30 23:13:26,547 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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-08-30 23:13:26,547 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 278 flow. Second operand 6 states and 751 transitions. [2023-08-30 23:13:26,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 116 transitions, 908 flow [2023-08-30 23:13:26,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 116 transitions, 880 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-30 23:13:26,571 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 386 flow [2023-08-30 23:13:26,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-30 23:13:26,572 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-30 23:13:26,572 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 386 flow [2023-08-30 23:13:26,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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-08-30 23:13:26,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:26,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:13:26,573 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:26,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1003712614, now seen corresponding path program 1 times [2023-08-30 23:13:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412128609] [2023-08-30 23:13:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412128609] [2023-08-30 23:13:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412128609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:13:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033136544] [2023-08-30 23:13:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:26,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:13:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:13:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:13:26,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 23:13:26,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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-08-30 23:13:26,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:26,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 23:13:26,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:27,328 INFO L130 PetriNetUnfolder]: 2078/3339 cut-off events. [2023-08-30 23:13:27,328 INFO L131 PetriNetUnfolder]: For 7318/7694 co-relation queries the response was YES. [2023-08-30 23:13:27,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 3339 events. 2078/3339 cut-off events. For 7318/7694 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19265 event pairs, 202 based on Foata normal form. 347/3580 useless extension candidates. Maximal degree in co-relation 14100. Up to 1517 conditions per place. [2023-08-30 23:13:27,352 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 102 selfloop transitions, 23 changer transitions 12/145 dead transitions. [2023-08-30 23:13:27,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 145 transitions, 1204 flow [2023-08-30 23:13:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:13:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:13:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 23:13:27,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165289256198347 [2023-08-30 23:13:27,356 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 23:13:27,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 23:13:27,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:27,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 23:13:27,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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-08-30 23:13:27,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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-08-30 23:13:27,362 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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-08-30 23:13:27,363 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 386 flow. Second operand 8 states and 1000 transitions. [2023-08-30 23:13:27,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 145 transitions, 1204 flow [2023-08-30 23:13:27,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 145 transitions, 1160 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:27,456 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 510 flow [2023-08-30 23:13:27,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-30 23:13:27,457 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-30 23:13:27,457 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 510 flow [2023-08-30 23:13:27,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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-08-30 23:13:27,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:27,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:27,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:13:27,458 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:27,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash 882816484, now seen corresponding path program 1 times [2023-08-30 23:13:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877749268] [2023-08-30 23:13:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:27,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877749268] [2023-08-30 23:13:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877749268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:27,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582567286] [2023-08-30 23:13:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:27,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:27,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:27,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 23:13:27,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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-08-30 23:13:27,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:27,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 23:13:27,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:28,312 INFO L130 PetriNetUnfolder]: 3189/5093 cut-off events. [2023-08-30 23:13:28,312 INFO L131 PetriNetUnfolder]: For 16898/17095 co-relation queries the response was YES. [2023-08-30 23:13:28,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21963 conditions, 5093 events. 3189/5093 cut-off events. For 16898/17095 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30993 event pairs, 475 based on Foata normal form. 101/5087 useless extension candidates. Maximal degree in co-relation 21932. Up to 2651 conditions per place. [2023-08-30 23:13:28,347 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 75 selfloop transitions, 2 changer transitions 49/132 dead transitions. [2023-08-30 23:13:28,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 132 transitions, 1376 flow [2023-08-30 23:13:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:13:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:13:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-30 23:13:28,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5237603305785123 [2023-08-30 23:13:28,350 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-30 23:13:28,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-30 23:13:28,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:28,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-30 23:13:28,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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-08-30 23:13:28,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:28,354 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:28,354 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 510 flow. Second operand 4 states and 507 transitions. [2023-08-30 23:13:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 132 transitions, 1376 flow [2023-08-30 23:13:28,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 1115 flow, removed 105 selfloop flow, removed 4 redundant places. [2023-08-30 23:13:28,639 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 398 flow [2023-08-30 23:13:28,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-08-30 23:13:28,639 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-30 23:13:28,640 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 398 flow [2023-08-30 23:13:28,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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-08-30 23:13:28,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:28,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:28,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:13:28,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:28,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash 680821688, now seen corresponding path program 2 times [2023-08-30 23:13:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241445484] [2023-08-30 23:13:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:28,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241445484] [2023-08-30 23:13:28,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241445484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:28,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:13:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590303100] [2023-08-30 23:13:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:28,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:13:28,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:28,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:13:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:13:28,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 23:13:28,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-08-30 23:13:28,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:28,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 23:13:28,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:29,481 INFO L130 PetriNetUnfolder]: 2508/4158 cut-off events. [2023-08-30 23:13:29,481 INFO L131 PetriNetUnfolder]: For 7922/8214 co-relation queries the response was YES. [2023-08-30 23:13:29,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15471 conditions, 4158 events. 2508/4158 cut-off events. For 7922/8214 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 26690 event pairs, 241 based on Foata normal form. 237/4238 useless extension candidates. Maximal degree in co-relation 15439. Up to 1038 conditions per place. [2023-08-30 23:13:29,504 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 66 selfloop transitions, 20 changer transitions 51/142 dead transitions. [2023-08-30 23:13:29,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1148 flow [2023-08-30 23:13:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 23:13:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 23:13:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1220 transitions. [2023-08-30 23:13:29,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2023-08-30 23:13:29,508 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1220 transitions. [2023-08-30 23:13:29,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1220 transitions. [2023-08-30 23:13:29,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:29,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1220 transitions. [2023-08-30 23:13:29,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:29,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 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-08-30 23:13:29,516 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 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-08-30 23:13:29,516 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 398 flow. Second operand 10 states and 1220 transitions. [2023-08-30 23:13:29,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1148 flow [2023-08-30 23:13:29,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 142 transitions, 1116 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 23:13:29,669 INFO L231 Difference]: Finished difference. Result has 75 places, 46 transitions, 342 flow [2023-08-30 23:13:29,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=75, PETRI_TRANSITIONS=46} [2023-08-30 23:13:29,671 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-08-30 23:13:29,671 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 46 transitions, 342 flow [2023-08-30 23:13:29,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-08-30 23:13:29,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:29,672 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, 1] [2023-08-30 23:13:29,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:13:29,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:29,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash 394606037, now seen corresponding path program 1 times [2023-08-30 23:13:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323803358] [2023-08-30 23:13:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:29,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323803358] [2023-08-30 23:13:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323803358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:29,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:29,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:29,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625851900] [2023-08-30 23:13:29,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:29,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:29,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 23:13:29,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 46 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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-08-30 23:13:29,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:29,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 23:13:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:30,126 INFO L130 PetriNetUnfolder]: 996/1730 cut-off events. [2023-08-30 23:13:30,126 INFO L131 PetriNetUnfolder]: For 4857/4905 co-relation queries the response was YES. [2023-08-30 23:13:30,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7323 conditions, 1730 events. 996/1730 cut-off events. For 4857/4905 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9259 event pairs, 247 based on Foata normal form. 37/1753 useless extension candidates. Maximal degree in co-relation 7297. Up to 1004 conditions per place. [2023-08-30 23:13:30,141 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 36 selfloop transitions, 1 changer transitions 51/90 dead transitions. [2023-08-30 23:13:30,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 828 flow [2023-08-30 23:13:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:13:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:13:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-30 23:13:30,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216942148760331 [2023-08-30 23:13:30,144 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-30 23:13:30,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-30 23:13:30,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:30,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-30 23:13:30,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:30,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:30,147 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-08-30 23:13:30,148 INFO L175 Difference]: Start difference. First operand has 75 places, 46 transitions, 342 flow. Second operand 4 states and 505 transitions. [2023-08-30 23:13:30,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 828 flow [2023-08-30 23:13:30,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 650 flow, removed 39 selfloop flow, removed 13 redundant places. [2023-08-30 23:13:30,170 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 195 flow [2023-08-30 23:13:30,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-08-30 23:13:30,171 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-30 23:13:30,171 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 195 flow [2023-08-30 23:13:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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-08-30 23:13:30,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:30,171 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, 1] [2023-08-30 23:13:30,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:13:30,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:30,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1316430573, now seen corresponding path program 2 times [2023-08-30 23:13:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492595751] [2023-08-30 23:13:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492595751] [2023-08-30 23:13:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492595751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:13:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726207667] [2023-08-30 23:13:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:30,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:13:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:13:30,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:13:30,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 23:13:30,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 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-08-30 23:13:30,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:30,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 23:13:30,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:30,706 INFO L130 PetriNetUnfolder]: 235/449 cut-off events. [2023-08-30 23:13:30,706 INFO L131 PetriNetUnfolder]: For 788/788 co-relation queries the response was YES. [2023-08-30 23:13:30,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 449 events. 235/449 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1843 event pairs, 42 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 1671. Up to 175 conditions per place. [2023-08-30 23:13:30,708 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 39 selfloop transitions, 4 changer transitions 26/72 dead transitions. [2023-08-30 23:13:30,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 536 flow [2023-08-30 23:13:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-08-30 23:13:30,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48642266824085006 [2023-08-30 23:13:30,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-08-30 23:13:30,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-08-30 23:13:30,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:30,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-08-30 23:13:30,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 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-08-30 23:13:30,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-08-30 23:13:30,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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-08-30 23:13:30,717 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 195 flow. Second operand 7 states and 824 transitions. [2023-08-30 23:13:30,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 536 flow [2023-08-30 23:13:30,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 488 flow, removed 5 selfloop flow, removed 12 redundant places. [2023-08-30 23:13:30,721 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 180 flow [2023-08-30 23:13:30,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-30 23:13:30,722 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-30 23:13:30,722 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 180 flow [2023-08-30 23:13:30,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 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-08-30 23:13:30,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:30,723 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, 1] [2023-08-30 23:13:30,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:13:30,723 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:30,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1035509873, now seen corresponding path program 3 times [2023-08-30 23:13:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662677790] [2023-08-30 23:13:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:13:30,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:13:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:13:30,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:13:30,808 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:13:30,809 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:13:30,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:13:30,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:13:30,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:13:30,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:13:30,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:13:30,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:13:30,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:13:30,812 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:30,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:13:30,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:13:30,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:13:30 BasicIcfg [2023-08-30 23:13:30,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:13:30,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:13:30,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:13:30,896 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:13:30,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:14" (3/4) ... [2023-08-30 23:13:30,897 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:13:30,985 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:13:30,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:13:30,986 INFO L158 Benchmark]: Toolchain (without parser) took 17957.89ms. Allocated memory was 73.4MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 50.4MB in the beginning and 549.8MB in the end (delta: -499.4MB). Peak memory consumption was 863.2MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,986 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 73.4MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:13:30,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.45ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 50.1MB in the beginning and 65.5MB in the end (delta: -15.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.31ms. Allocated memory is still 88.1MB. Free memory was 65.5MB in the beginning and 63.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,987 INFO L158 Benchmark]: Boogie Preprocessor took 26.47ms. Allocated memory is still 88.1MB. Free memory was 63.3MB in the beginning and 61.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,988 INFO L158 Benchmark]: RCFGBuilder took 709.36ms. Allocated memory is still 88.1MB. Free memory was 61.3MB in the beginning and 61.1MB in the end (delta: 143.8kB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,988 INFO L158 Benchmark]: TraceAbstraction took 16518.85ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 60.6MB in the beginning and 564.5MB in the end (delta: -503.9MB). Peak memory consumption was 842.0MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,988 INFO L158 Benchmark]: Witness Printer took 90.35ms. Allocated memory is still 1.4GB. Free memory was 564.5MB in the beginning and 549.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:13:30,990 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.19ms. Allocated memory is still 73.4MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.45ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 50.1MB in the beginning and 65.5MB in the end (delta: -15.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.31ms. Allocated memory is still 88.1MB. Free memory was 65.5MB in the beginning and 63.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.47ms. Allocated memory is still 88.1MB. Free memory was 63.3MB in the beginning and 61.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 709.36ms. Allocated memory is still 88.1MB. Free memory was 61.3MB in the beginning and 61.1MB in the end (delta: 143.8kB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16518.85ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 60.6MB in the beginning and 564.5MB in the end (delta: -503.9MB). Peak memory consumption was 842.0MB. Max. memory is 16.1GB. * Witness Printer took 90.35ms. Allocated memory is still 1.4GB. Free memory was 564.5MB in the beginning and 549.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 40 PlacesAfterwards, 126 TransitionsBefore, 28 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 6492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3570, independent: 3377, independent conditional: 0, independent unconditional: 3377, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1596, independent: 1556, independent conditional: 0, independent unconditional: 1556, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3570, independent: 1821, independent conditional: 0, independent unconditional: 1821, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 1596, unknown conditional: 0, unknown unconditional: 1596] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=-2, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=-1, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=1, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 859]: 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: 861]: 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: 857]: 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: 863]: 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 9 procedures, 165 locations, 7 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: 16.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1217 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 40 mSDtfsCounter, 1217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 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-08-30 23:13:31,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE