./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:55:53,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:55:53,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:55:53,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:55:53,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:55:53,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:55:53,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:55:53,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:55:53,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:55:53,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:55:53,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:55:53,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:55:53,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:55:53,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:55:53,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:55:53,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:55:53,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:55:53,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:55:53,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:55:53,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:55:53,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:55:53,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:55:53,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:55:53,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:55:53,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:55:53,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:55:53,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:55:53,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:55:53,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:55:53,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:55:53,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:55:53,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:55:53,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:55:53,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:55:53,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:55:53,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:55:53,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:55:53,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:55:53,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:55:53,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:55:53,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:55:53,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:55:53,197 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:55:53,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:55:53,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:55:53,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:55:53,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:55:53,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:55:53,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:55:53,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:55:53,202 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:55:53,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:55:53,202 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:55:53,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:55:53,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:55:53,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:55:53,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:55:53,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:55:53,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:55:53,204 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:55:53,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:55:53,204 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:55:53,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:55:53,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:55:53,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:55:53,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:55:53,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:55:53,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:55:53,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:55:53,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:55:53,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:55:53,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:55:53,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:55:53,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:55:53,207 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:55:53,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:55:53,207 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:55:53,207 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 -> 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 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 -> AFTER [2023-08-30 16:55:53,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:55:53,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:55:53,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:55:53,532 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:55:53,533 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:55:53,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:55:54,796 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:55:55,074 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:55:55,075 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:55:55,088 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/195b9c66b/046a93f025a443de8b756f5f14bcee5d/FLAG294a564ed [2023-08-30 16:55:55,109 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/195b9c66b/046a93f025a443de8b756f5f14bcee5d [2023-08-30 16:55:55,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:55:55,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:55:55,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:55:55,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:55:55,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:55:55,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1327d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55, skipping insertion in model container [2023-08-30 16:55:55,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:55:55,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:55:55,331 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-30 16:55:55,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:55:55,567 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:55:55,578 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-30 16:55:55,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:55:55,666 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:55:55,666 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:55:55,672 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:55:55,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55 WrapperNode [2023-08-30 16:55:55,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:55:55,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:55:55,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:55:55,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:55:55,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,746 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-30 16:55:55,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:55:55,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:55:55,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:55:55,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:55:55,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:55:55,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:55:55,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:55:55,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:55:55,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (1/1) ... [2023-08-30 16:55:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:55:55,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:55:55,842 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 16:55:55,865 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 16:55:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:55:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:55:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:55:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:55:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:55:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:55:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:55:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:55:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:55:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:55:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:55:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:55:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:55:55,886 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 16:55:56,079 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:55:56,081 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:55:56,299 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:55:56,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:55:56,525 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:55:56,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:55:56 BoogieIcfgContainer [2023-08-30 16:55:56,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:55:56,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:55:56,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:55:56,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:55:56,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:55:55" (1/3) ... [2023-08-30 16:55:56,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4bd54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:55:56, skipping insertion in model container [2023-08-30 16:55:56,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:55" (2/3) ... [2023-08-30 16:55:56,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4bd54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:55:56, skipping insertion in model container [2023-08-30 16:55:56,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:55:56" (3/3) ... [2023-08-30 16:55:56,536 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:55:56,541 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:55:56,547 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:55:56,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:55:56,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:55:56,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:55:56,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2023-08-30 16:55:56,664 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-08-30 16:55:56,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:55:56,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-30 16:55:56,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2023-08-30 16:55:56,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2023-08-30 16:55:56,676 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:55:56,684 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2023-08-30 16:55:56,686 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2023-08-30 16:55:56,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2023-08-30 16:55:56,705 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-08-30 16:55:56,705 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:55:56,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-30 16:55:56,707 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-08-30 16:56:00,271 INFO L134 LiptonReduction]: Checked pairs total: 2470 [2023-08-30 16:56:00,271 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-30 16:56:00,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:56:00,289 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;@751ed4a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:56:00,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:56:00,292 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:56:00,292 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:56:00,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:00,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:56:00,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:00,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 401562, now seen corresponding path program 1 times [2023-08-30 16:56:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:00,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020641191] [2023-08-30 16:56:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:56:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020641191] [2023-08-30 16:56:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020641191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:56:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631628849] [2023-08-30 16:56:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:00,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:56:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:56:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:56:00,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2023-08-30 16:56:00,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 16:56:00,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:00,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2023-08-30 16:56:00,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:00,819 INFO L130 PetriNetUnfolder]: 111/223 cut-off events. [2023-08-30 16:56:00,820 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 16:56:00,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 223 events. 111/223 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 940 event pairs, 12 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 427. Up to 166 conditions per place. [2023-08-30 16:56:00,825 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-08-30 16:56:00,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 105 flow [2023-08-30 16:56:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:56:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:56:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2023-08-30 16:56:00,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911242603550296 [2023-08-30 16:56:00,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 249 transitions. [2023-08-30 16:56:00,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 249 transitions. [2023-08-30 16:56:00,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:00,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 249 transitions. [2023-08-30 16:56:00,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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 16:56:00,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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 16:56:00,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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 16:56:00,861 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 249 transitions. [2023-08-30 16:56:00,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 105 flow [2023-08-30 16:56:00,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:56:00,865 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-08-30 16:56:00,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-08-30 16:56:00,871 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-08-30 16:56:00,872 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-08-30 16:56:00,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 16:56:00,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:00,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:00,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:56:00,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:00,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1520528015, now seen corresponding path program 1 times [2023-08-30 16:56:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:00,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843453634] [2023-08-30 16:56:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:02,142 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 16:56:02,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:02,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843453634] [2023-08-30 16:56:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843453634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:02,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:56:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410890020] [2023-08-30 16:56:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:02,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:56:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:56:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:56:02,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 169 [2023-08-30 16:56:02,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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 16:56:02,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:02,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 169 [2023-08-30 16:56:02,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:02,276 INFO L130 PetriNetUnfolder]: 80/162 cut-off events. [2023-08-30 16:56:02,277 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:56:02,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 162 events. 80/162 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 576 event pairs, 20 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 332. Up to 117 conditions per place. [2023-08-30 16:56:02,279 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-30 16:56:02,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 86 flow [2023-08-30 16:56:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:56:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:56:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-08-30 16:56:02,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4516765285996055 [2023-08-30 16:56:02,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-08-30 16:56:02,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-08-30 16:56:02,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:02,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-08-30 16:56:02,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 16:56:02,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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 16:56:02,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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 16:56:02,290 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 229 transitions. [2023-08-30 16:56:02,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 86 flow [2023-08-30 16:56:02,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:56:02,291 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2023-08-30 16:56:02,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-08-30 16:56:02,292 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-08-30 16:56:02,292 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2023-08-30 16:56:02,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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 16:56:02,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:02,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:02,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:56:02,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:02,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -108273127, now seen corresponding path program 1 times [2023-08-30 16:56:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985669177] [2023-08-30 16:56:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:56:03,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985669177] [2023-08-30 16:56:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985669177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:03,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:56:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785675186] [2023-08-30 16:56:03,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:03,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:56:03,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:03,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:56:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:56:03,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 169 [2023-08-30 16:56:03,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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 16:56:03,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:03,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 169 [2023-08-30 16:56:03,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:03,438 INFO L130 PetriNetUnfolder]: 115/212 cut-off events. [2023-08-30 16:56:03,438 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2023-08-30 16:56:03,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 212 events. 115/212 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 812 event pairs, 8 based on Foata normal form. 3/213 useless extension candidates. Maximal degree in co-relation 471. Up to 131 conditions per place. [2023-08-30 16:56:03,444 INFO L137 encePairwiseOnDemand]: 161/169 looper letters, 24 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2023-08-30 16:56:03,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 35 transitions, 162 flow [2023-08-30 16:56:03,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:56:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:56:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 376 transitions. [2023-08-30 16:56:03,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44497041420118344 [2023-08-30 16:56:03,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 376 transitions. [2023-08-30 16:56:03,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 376 transitions. [2023-08-30 16:56:03,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:03,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 376 transitions. [2023-08-30 16:56:03,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 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 16:56:03,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 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 16:56:03,450 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 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 16:56:03,451 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 376 transitions. [2023-08-30 16:56:03,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 35 transitions, 162 flow [2023-08-30 16:56:03,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:56:03,452 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 108 flow [2023-08-30 16:56:03,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-08-30 16:56:03,453 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-08-30 16:56:03,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 108 flow [2023-08-30 16:56:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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 16:56:03,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:03,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:56:03,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:03,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -109155697, now seen corresponding path program 2 times [2023-08-30 16:56:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017476256] [2023-08-30 16:56:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:04,210 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 16:56:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:04,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017476256] [2023-08-30 16:56:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017476256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:56:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756299882] [2023-08-30 16:56:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:04,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:56:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:56:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:56:04,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 169 [2023-08-30 16:56:04,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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 16:56:04,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:04,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 169 [2023-08-30 16:56:04,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:04,377 INFO L130 PetriNetUnfolder]: 132/260 cut-off events. [2023-08-30 16:56:04,377 INFO L131 PetriNetUnfolder]: For 274/277 co-relation queries the response was YES. [2023-08-30 16:56:04,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 260 events. 132/260 cut-off events. For 274/277 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1069 event pairs, 18 based on Foata normal form. 15/274 useless extension candidates. Maximal degree in co-relation 791. Up to 101 conditions per place. [2023-08-30 16:56:04,380 INFO L137 encePairwiseOnDemand]: 165/169 looper letters, 21 selfloop transitions, 3 changer transitions 11/36 dead transitions. [2023-08-30 16:56:04,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 227 flow [2023-08-30 16:56:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:56:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:56:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2023-08-30 16:56:04,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452662721893491 [2023-08-30 16:56:04,382 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 301 transitions. [2023-08-30 16:56:04,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 301 transitions. [2023-08-30 16:56:04,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:04,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 301 transitions. [2023-08-30 16:56:04,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 16:56:04,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 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 16:56:04,389 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 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 16:56:04,390 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 108 flow. Second operand 4 states and 301 transitions. [2023-08-30 16:56:04,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 227 flow [2023-08-30 16:56:04,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:56:04,394 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 86 flow [2023-08-30 16:56:04,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-08-30 16:56:04,395 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2023-08-30 16:56:04,396 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 86 flow [2023-08-30 16:56:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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 16:56:04,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:04,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:56:04,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:04,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1318078625, now seen corresponding path program 1 times [2023-08-30 16:56:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596171956] [2023-08-30 16:56:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:05,112 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 16:56:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:05,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596171956] [2023-08-30 16:56:05,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596171956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:05,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:56:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812325541] [2023-08-30 16:56:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:05,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:56:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:05,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:56:05,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:56:05,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 169 [2023-08-30 16:56:05,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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 16:56:05,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:05,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 169 [2023-08-30 16:56:05,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:05,213 INFO L130 PetriNetUnfolder]: 80/157 cut-off events. [2023-08-30 16:56:05,213 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2023-08-30 16:56:05,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 157 events. 80/157 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 467 event pairs, 22 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 519. Up to 130 conditions per place. [2023-08-30 16:56:05,215 INFO L137 encePairwiseOnDemand]: 162/169 looper letters, 23 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2023-08-30 16:56:05,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 200 flow [2023-08-30 16:56:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:56:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:56:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2023-08-30 16:56:05,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45798816568047335 [2023-08-30 16:56:05,217 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 387 transitions. [2023-08-30 16:56:05,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 387 transitions. [2023-08-30 16:56:05,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:05,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 387 transitions. [2023-08-30 16:56:05,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.4) internal successors, (387), 5 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 16:56:05,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 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 16:56:05,221 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 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 16:56:05,221 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 86 flow. Second operand 5 states and 387 transitions. [2023-08-30 16:56:05,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 200 flow [2023-08-30 16:56:05,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 176 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 16:56:05,223 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 112 flow [2023-08-30 16:56:05,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:56:05,224 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-08-30 16:56:05,224 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 112 flow [2023-08-30 16:56:05,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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 16:56:05,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:05,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:05,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:56:05,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:05,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash -970858713, now seen corresponding path program 2 times [2023-08-30 16:56:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:05,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556555989] [2023-08-30 16:56:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:05,601 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 16:56:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556555989] [2023-08-30 16:56:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556555989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:56:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594103815] [2023-08-30 16:56:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:05,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:56:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:56:05,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:56:05,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-08-30 16:56:05,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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 16:56:05,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:05,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-08-30 16:56:05,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:05,695 INFO L130 PetriNetUnfolder]: 78/154 cut-off events. [2023-08-30 16:56:05,695 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2023-08-30 16:56:05,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 154 events. 78/154 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 460 event pairs, 21 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 532. Up to 129 conditions per place. [2023-08-30 16:56:05,696 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 23 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2023-08-30 16:56:05,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 208 flow [2023-08-30 16:56:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:56:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:56:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2023-08-30 16:56:05,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46449704142011833 [2023-08-30 16:56:05,699 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 314 transitions. [2023-08-30 16:56:05,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 314 transitions. [2023-08-30 16:56:05,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:05,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 314 transitions. [2023-08-30 16:56:05,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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 16:56:05,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 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 16:56:05,702 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 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 16:56:05,702 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 112 flow. Second operand 4 states and 314 transitions. [2023-08-30 16:56:05,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 208 flow [2023-08-30 16:56:05,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:56:05,706 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 145 flow [2023-08-30 16:56:05,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-30 16:56:05,709 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-08-30 16:56:05,709 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 145 flow [2023-08-30 16:56:05,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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 16:56:05,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:05,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:05,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:56:05,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:05,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1050357630, now seen corresponding path program 1 times [2023-08-30 16:56:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585543117] [2023-08-30 16:56:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:06,472 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 16:56:06,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585543117] [2023-08-30 16:56:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585543117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:56:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509191033] [2023-08-30 16:56:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:06,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:56:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:56:06,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:56:06,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 169 [2023-08-30 16:56:06,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 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 16:56:06,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:06,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 169 [2023-08-30 16:56:06,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:06,618 INFO L130 PetriNetUnfolder]: 78/161 cut-off events. [2023-08-30 16:56:06,618 INFO L131 PetriNetUnfolder]: For 358/358 co-relation queries the response was YES. [2023-08-30 16:56:06,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 161 events. 78/161 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 506 event pairs, 57 based on Foata normal form. 14/175 useless extension candidates. Maximal degree in co-relation 608. Up to 134 conditions per place. [2023-08-30 16:56:06,619 INFO L137 encePairwiseOnDemand]: 163/169 looper letters, 20 selfloop transitions, 5 changer transitions 7/33 dead transitions. [2023-08-30 16:56:06,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 259 flow [2023-08-30 16:56:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:56:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:56:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 450 transitions. [2023-08-30 16:56:06,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4437869822485207 [2023-08-30 16:56:06,622 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 450 transitions. [2023-08-30 16:56:06,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 450 transitions. [2023-08-30 16:56:06,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:06,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 450 transitions. [2023-08-30 16:56:06,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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 16:56:06,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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 16:56:06,627 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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 16:56:06,627 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 145 flow. Second operand 6 states and 450 transitions. [2023-08-30 16:56:06,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 259 flow [2023-08-30 16:56:06,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 230 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 16:56:06,630 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 143 flow [2023-08-30 16:56:06,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-30 16:56:06,631 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2023-08-30 16:56:06,631 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 143 flow [2023-08-30 16:56:06,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 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 16:56:06,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:06,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:06,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:56:06,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:06,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1132719162, now seen corresponding path program 2 times [2023-08-30 16:56:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:06,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312796460] [2023-08-30 16:56:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:06,979 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 16:56:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:06,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312796460] [2023-08-30 16:56:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312796460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:06,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:56:06,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137815997] [2023-08-30 16:56:06,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:06,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:56:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:56:06,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:56:07,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 169 [2023-08-30 16:56:07,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:56:07,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:07,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 169 [2023-08-30 16:56:07,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:07,120 INFO L130 PetriNetUnfolder]: 42/106 cut-off events. [2023-08-30 16:56:07,122 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2023-08-30 16:56:07,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 106 events. 42/106 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 337 event pairs, 4 based on Foata normal form. 14/119 useless extension candidates. Maximal degree in co-relation 406. Up to 47 conditions per place. [2023-08-30 16:56:07,123 INFO L137 encePairwiseOnDemand]: 161/169 looper letters, 21 selfloop transitions, 7 changer transitions 19/50 dead transitions. [2023-08-30 16:56:07,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 372 flow [2023-08-30 16:56:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:56:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:56:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 659 transitions. [2023-08-30 16:56:07,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43326758711374097 [2023-08-30 16:56:07,127 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 659 transitions. [2023-08-30 16:56:07,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 659 transitions. [2023-08-30 16:56:07,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:07,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 659 transitions. [2023-08-30 16:56:07,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.22222222222223) internal successors, (659), 9 states have internal predecessors, (659), 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 16:56:07,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 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 16:56:07,132 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 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 16:56:07,132 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 143 flow. Second operand 9 states and 659 transitions. [2023-08-30 16:56:07,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 372 flow [2023-08-30 16:56:07,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 347 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-30 16:56:07,135 INFO L231 Difference]: Finished difference. Result has 47 places, 21 transitions, 151 flow [2023-08-30 16:56:07,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=47, PETRI_TRANSITIONS=21} [2023-08-30 16:56:07,138 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 23 predicate places. [2023-08-30 16:56:07,138 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 21 transitions, 151 flow [2023-08-30 16:56:07,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:56:07,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:07,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:07,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:56:07,139 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:07,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 133911163, now seen corresponding path program 1 times [2023-08-30 16:56:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:07,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761885442] [2023-08-30 16:56:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:07,338 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 16:56:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761885442] [2023-08-30 16:56:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761885442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:56:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471598812] [2023-08-30 16:56:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:56:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:56:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:56:07,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-08-30 16:56:07,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 21 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:56:07,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:07,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-08-30 16:56:07,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:07,433 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-30 16:56:07,434 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2023-08-30 16:56:07,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 51 events. 17/51 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 5 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 222. Up to 21 conditions per place. [2023-08-30 16:56:07,434 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 18 selfloop transitions, 5 changer transitions 6/32 dead transitions. [2023-08-30 16:56:07,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 275 flow [2023-08-30 16:56:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:56:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:56:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2023-08-30 16:56:07,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4536489151873767 [2023-08-30 16:56:07,437 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 460 transitions. [2023-08-30 16:56:07,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 460 transitions. [2023-08-30 16:56:07,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:07,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 460 transitions. [2023-08-30 16:56:07,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 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 16:56:07,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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 16:56:07,441 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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 16:56:07,441 INFO L175 Difference]: Start difference. First operand has 47 places, 21 transitions, 151 flow. Second operand 6 states and 460 transitions. [2023-08-30 16:56:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 275 flow [2023-08-30 16:56:07,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 212 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-08-30 16:56:07,443 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 126 flow [2023-08-30 16:56:07,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2023-08-30 16:56:07,444 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2023-08-30 16:56:07,444 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 126 flow [2023-08-30 16:56:07,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:56:07,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:07,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:56:07,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:07,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -950988202, now seen corresponding path program 1 times [2023-08-30 16:56:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:07,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649417791] [2023-08-30 16:56:07,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:56:08,465 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 16:56:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:56:08,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649417791] [2023-08-30 16:56:08,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649417791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:56:08,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:56:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:56:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139573959] [2023-08-30 16:56:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:56:08,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:56:08,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:56:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:56:08,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:56:08,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 169 [2023-08-30 16:56:08,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 21 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 72.75) internal successors, (582), 8 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:56:08,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:56:08,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 169 [2023-08-30 16:56:08,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:56:08,631 INFO L130 PetriNetUnfolder]: 15/54 cut-off events. [2023-08-30 16:56:08,631 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2023-08-30 16:56:08,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 54 events. 15/54 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 209. Up to 27 conditions per place. [2023-08-30 16:56:08,632 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 17 selfloop transitions, 4 changer transitions 12/34 dead transitions. [2023-08-30 16:56:08,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 268 flow [2023-08-30 16:56:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:56:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:56:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 454 transitions. [2023-08-30 16:56:08,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4477317554240631 [2023-08-30 16:56:08,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 454 transitions. [2023-08-30 16:56:08,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 454 transitions. [2023-08-30 16:56:08,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:56:08,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 454 transitions. [2023-08-30 16:56:08,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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 16:56:08,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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 16:56:08,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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 16:56:08,639 INFO L175 Difference]: Start difference. First operand has 41 places, 21 transitions, 126 flow. Second operand 6 states and 454 transitions. [2023-08-30 16:56:08,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 268 flow [2023-08-30 16:56:08,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 227 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-30 16:56:08,640 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 102 flow [2023-08-30 16:56:08,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2023-08-30 16:56:08,642 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2023-08-30 16:56:08,642 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 102 flow [2023-08-30 16:56:08,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.75) internal successors, (582), 8 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:56:08,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:56:08,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:56:08,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:56:08,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:56:08,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:56:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1424215650, now seen corresponding path program 2 times [2023-08-30 16:56:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:56:08,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006304696] [2023-08-30 16:56:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:56:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:56:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:56:08,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:56:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:56:08,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:56:08,776 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:56:08,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:56:08,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:56:08,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:56:08,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:56:08,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:56:08,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:56:08,782 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2023-08-30 16:56:08,787 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:56:08,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:56:08,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:56:08 BasicIcfg [2023-08-30 16:56:08,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:56:08,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:56:08,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:56:08,854 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:56:08,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:55:56" (3/4) ... [2023-08-30 16:56:08,856 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:56:08,928 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:56:08,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:56:08,929 INFO L158 Benchmark]: Toolchain (without parser) took 13817.20ms. Allocated memory was 83.9MB in the beginning and 260.0MB in the end (delta: 176.2MB). Free memory was 60.0MB in the beginning and 211.7MB in the end (delta: -151.7MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,930 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:56:08,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.91ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 56.8MB in the end (delta: 2.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.03ms. Allocated memory is still 83.9MB. Free memory was 56.8MB in the beginning and 54.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,930 INFO L158 Benchmark]: Boogie Preprocessor took 58.82ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 52.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,931 INFO L158 Benchmark]: RCFGBuilder took 720.68ms. Allocated memory is still 83.9MB. Free memory was 52.3MB in the beginning and 48.7MB in the end (delta: 3.6MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,932 INFO L158 Benchmark]: TraceAbstraction took 12323.11ms. Allocated memory was 83.9MB in the beginning and 260.0MB in the end (delta: 176.2MB). Free memory was 48.2MB in the beginning and 218.0MB in the end (delta: -169.8MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,932 INFO L158 Benchmark]: Witness Printer took 74.95ms. Allocated memory is still 260.0MB. Free memory was 218.0MB in the beginning and 211.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 16:56:08,933 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.18ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.91ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 56.8MB in the end (delta: 2.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.03ms. Allocated memory is still 83.9MB. Free memory was 56.8MB in the beginning and 54.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.82ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 52.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.68ms. Allocated memory is still 83.9MB. Free memory was 52.3MB in the beginning and 48.7MB in the end (delta: 3.6MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12323.11ms. Allocated memory was 83.9MB in the beginning and 260.0MB in the end (delta: 176.2MB). Free memory was 48.2MB in the beginning and 218.0MB in the end (delta: -169.8MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. * Witness Printer took 74.95ms. Allocated memory is still 260.0MB. Free memory was 218.0MB in the beginning and 211.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 90 PlacesBefore, 24 PlacesAfterwards, 85 TransitionsBefore, 17 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 2470 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1129, independent: 1014, independent conditional: 0, independent unconditional: 1014, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 582, independent: 560, independent conditional: 0, independent unconditional: 560, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1129, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 582, unknown conditional: 0, unknown unconditional: 582] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-2, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=-1, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 118 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=8, InterpolantAutomatonStates: 51, 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, 6.2s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:56:08,968 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