./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.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/mix031.oepc.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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --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:49:11,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:49:11,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:49:12,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:49:12,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:49:12,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:49:12,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:49:12,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:49:12,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:49:12,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:49:12,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:49:12,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:49:12,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:49:12,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:49:12,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:49:12,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:49:12,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:49:12,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:49:12,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:49:12,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:49:12,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:49:12,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:49:12,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:49:12,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:49:12,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:49:12,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:49:12,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:49:12,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:49:12,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:49:12,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:49:12,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:49:12,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:49:12,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:49:12,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:49:12,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:49:12,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:49:12,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:49:12,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:49:12,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:49:12,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:49:12,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:49:12,072 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:49:12,098 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:49:12,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:49:12,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:49:12,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:49:12,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:49:12,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:49:12,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:49:12,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:49:12,102 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:49:12,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:49:12,103 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:49:12,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:49:12,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:49:12,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:49:12,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:49:12,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:49:12,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:49:12,104 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:49:12,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:49:12,104 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:49:12,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:49:12,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:49:12,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:49:12,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:49:12,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:49:12,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:49:12,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:49:12,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:49:12,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:49:12,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:49:12,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:49:12,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:49:12,107 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:49:12,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:49:12,107 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:49:12,108 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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf 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:49:12,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:49:12,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:49:12,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:49:12,397 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:49:12,400 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:49:12,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-30 16:49:13,417 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:49:13,692 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:49:13,692 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-30 16:49:13,706 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ee08f20/56d70cadc0584fbfac3d29712f2b76dd/FLAGed16869af [2023-08-30 16:49:13,721 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ee08f20/56d70cadc0584fbfac3d29712f2b76dd [2023-08-30 16:49:13,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:49:13,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:49:13,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:49:13,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:49:13,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:49:13,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:49:13" (1/1) ... [2023-08-30 16:49:13,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371d9f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:13, skipping insertion in model container [2023-08-30 16:49:13,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:49:13" (1/1) ... [2023-08-30 16:49:13,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:49:13,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:49:13,872 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/mix031.oepc.i[945,958] [2023-08-30 16:49:13,993 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:49:14,004 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:49:14,013 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/mix031.oepc.i[945,958] [2023-08-30 16:49:14,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:49:14,100 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:49:14,100 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:49:14,106 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:49:14,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14 WrapperNode [2023-08-30 16:49:14,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:49:14,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:49:14,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:49:14,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:49:14,120 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:49:14" (1/1) ... [2023-08-30 16:49:14,145 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:49:14" (1/1) ... [2023-08-30 16:49:14,168 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-08-30 16:49:14,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:49:14,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:49:14,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:49:14,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:49:14,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:49:14,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:49:14,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:49:14,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:49:14,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (1/1) ... [2023-08-30 16:49:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:49:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:49:14,234 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:49:14,261 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:49:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:49:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:49:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:49:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:49:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:49:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:49:14,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:49:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:49:14,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:49:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:49:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:49:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:49:14,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:49:14,274 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:49:14,455 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:49:14,457 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:49:14,714 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:49:14,858 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:49:14,858 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:49:14,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:14 BoogieIcfgContainer [2023-08-30 16:49:14,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:49:14,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:49:14,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:49:14,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:49:14,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:49:13" (1/3) ... [2023-08-30 16:49:14,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce62de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:49:14, skipping insertion in model container [2023-08-30 16:49:14,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:14" (2/3) ... [2023-08-30 16:49:14,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce62de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:49:14, skipping insertion in model container [2023-08-30 16:49:14,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:14" (3/3) ... [2023-08-30 16:49:14,869 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-08-30 16:49:14,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:49:14,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:49:14,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:49:14,884 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:49:14,949 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:49:14,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2023-08-30 16:49:15,042 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2023-08-30 16:49:15,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:49:15,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-30 16:49:15,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2023-08-30 16:49:15,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2023-08-30 16:49:15,056 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:49:15,064 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2023-08-30 16:49:15,066 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2023-08-30 16:49:15,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2023-08-30 16:49:15,088 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2023-08-30 16:49:15,089 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:49:15,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-30 16:49:15,091 INFO L119 LiptonReduction]: Number of co-enabled transitions 1346 [2023-08-30 16:49:17,997 INFO L134 LiptonReduction]: Checked pairs total: 3560 [2023-08-30 16:49:17,997 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-30 16:49:18,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:49:18,014 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;@12b3a7a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:49:18,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:49:18,017 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:49:18,017 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:49:18,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:18,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:49:18,018 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:49:18,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 425322, now seen corresponding path program 1 times [2023-08-30 16:49:18,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:18,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558532041] [2023-08-30 16:49:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:18,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:18,318 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:49:18,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:18,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558532041] [2023-08-30 16:49:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558532041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:18,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:49:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071823037] [2023-08-30 16:49:18,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:18,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:49:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:49:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:49:18,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 180 [2023-08-30 16:49:18,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:49:18,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:18,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 180 [2023-08-30 16:49:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:18,516 INFO L130 PetriNetUnfolder]: 204/430 cut-off events. [2023-08-30 16:49:18,520 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 16:49:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 430 events. 204/430 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2139 event pairs, 24 based on Foata normal form. 20/409 useless extension candidates. Maximal degree in co-relation 787. Up to 292 conditions per place. [2023-08-30 16:49:18,525 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2023-08-30 16:49:18,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 131 flow [2023-08-30 16:49:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:49:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:49:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-30 16:49:18,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2023-08-30 16:49:18,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-30 16:49:18,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-30 16:49:18,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:18,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-30 16:49:18,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:49:18,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:49:18,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:49:18,559 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 284 transitions. [2023-08-30 16:49:18,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 131 flow [2023-08-30 16:49:18,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:18,564 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-30 16:49:18,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 16:49:18,568 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2023-08-30 16:49:18,569 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-30 16:49:18,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:49:18,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:18,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:18,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:49:18,571 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:49:18,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1852132756, now seen corresponding path program 1 times [2023-08-30 16:49:18,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:18,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121520234] [2023-08-30 16:49:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:18,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:18,936 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:49:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121520234] [2023-08-30 16:49:18,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121520234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:18,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:18,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:49:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176698011] [2023-08-30 16:49:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:18,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:49:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:49:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:49:18,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 180 [2023-08-30 16:49:18,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:49:18,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:18,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 180 [2023-08-30 16:49:18,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:19,114 INFO L130 PetriNetUnfolder]: 287/508 cut-off events. [2023-08-30 16:49:19,115 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-30 16:49:19,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 287/508 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1971 event pairs, 139 based on Foata normal form. 36/544 useless extension candidates. Maximal degree in co-relation 1058. Up to 417 conditions per place. [2023-08-30 16:49:19,118 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-30 16:49:19,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 180 flow [2023-08-30 16:49:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:49:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:49:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2023-08-30 16:49:19,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2023-08-30 16:49:19,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 428 transitions. [2023-08-30 16:49:19,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 428 transitions. [2023-08-30 16:49:19,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:19,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 428 transitions. [2023-08-30 16:49:19,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:49:19,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:19,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:19,126 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 428 transitions. [2023-08-30 16:49:19,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 180 flow [2023-08-30 16:49:19,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:19,127 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 67 flow [2023-08-30 16:49:19,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 16:49:19,128 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-30 16:49:19,128 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 67 flow [2023-08-30 16:49:19,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:49:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:19,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:49:19,129 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:49:19,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1568360589, now seen corresponding path program 1 times [2023-08-30 16:49:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559711089] [2023-08-30 16:49:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:19,276 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:49:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559711089] [2023-08-30 16:49:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559711089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:49:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58087982] [2023-08-30 16:49:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:19,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:49:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:19,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:49:19,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:49:19,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 180 [2023-08-30 16:49:19,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:49:19,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:19,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 180 [2023-08-30 16:49:19,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:19,407 INFO L130 PetriNetUnfolder]: 253/446 cut-off events. [2023-08-30 16:49:19,408 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2023-08-30 16:49:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 446 events. 253/446 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1629 event pairs, 83 based on Foata normal form. 24/470 useless extension candidates. Maximal degree in co-relation 1080. Up to 305 conditions per place. [2023-08-30 16:49:19,410 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 23 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2023-08-30 16:49:19,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 185 flow [2023-08-30 16:49:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:49:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:49:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 424 transitions. [2023-08-30 16:49:19,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711111111111111 [2023-08-30 16:49:19,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 424 transitions. [2023-08-30 16:49:19,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 424 transitions. [2023-08-30 16:49:19,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:19,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 424 transitions. [2023-08-30 16:49:19,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 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:49:19,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:19,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:19,416 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 67 flow. Second operand 5 states and 424 transitions. [2023-08-30 16:49:19,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 185 flow [2023-08-30 16:49:19,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 176 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:19,419 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 75 flow [2023-08-30 16:49:19,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-30 16:49:19,420 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2023-08-30 16:49:19,420 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 75 flow [2023-08-30 16:49:19,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:49:19,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:19,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:19,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:49:19,422 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:49:19,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1864494483, now seen corresponding path program 1 times [2023-08-30 16:49:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913163814] [2023-08-30 16:49:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:19,577 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:49:19,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:19,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913163814] [2023-08-30 16:49:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913163814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:19,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:49:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985713544] [2023-08-30 16:49:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:49:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:49:19,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:49:19,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 180 [2023-08-30 16:49:19,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:49:19,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:19,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 180 [2023-08-30 16:49:19,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:19,727 INFO L130 PetriNetUnfolder]: 225/402 cut-off events. [2023-08-30 16:49:19,727 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2023-08-30 16:49:19,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 402 events. 225/402 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1430 event pairs, 123 based on Foata normal form. 24/426 useless extension candidates. Maximal degree in co-relation 1002. Up to 277 conditions per place. [2023-08-30 16:49:19,729 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 25 selfloop transitions, 3 changer transitions 12/40 dead transitions. [2023-08-30 16:49:19,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 205 flow [2023-08-30 16:49:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:49:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:49:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2023-08-30 16:49:19,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-08-30 16:49:19,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 426 transitions. [2023-08-30 16:49:19,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 426 transitions. [2023-08-30 16:49:19,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:19,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 426 transitions. [2023-08-30 16:49:19,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:49:19,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:19,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:19,737 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 75 flow. Second operand 5 states and 426 transitions. [2023-08-30 16:49:19,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 205 flow [2023-08-30 16:49:19,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 191 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 16:49:19,741 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 78 flow [2023-08-30 16:49:19,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-30 16:49:19,743 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2023-08-30 16:49:19,743 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 78 flow [2023-08-30 16:49:19,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:49:19,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:19,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:19,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:49:19,744 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:49:19,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1852244946, now seen corresponding path program 1 times [2023-08-30 16:49:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849327684] [2023-08-30 16:49:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:19,951 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:49:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849327684] [2023-08-30 16:49:19,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849327684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:19,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:19,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:49:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187822275] [2023-08-30 16:49:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:49:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:19,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:49:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:49:19,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-30 16:49:19,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:49:19,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:19,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-30 16:49:19,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:20,028 INFO L130 PetriNetUnfolder]: 43/113 cut-off events. [2023-08-30 16:49:20,029 INFO L131 PetriNetUnfolder]: For 45/46 co-relation queries the response was YES. [2023-08-30 16:49:20,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 113 events. 43/113 cut-off events. For 45/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 340 event pairs, 14 based on Foata normal form. 14/125 useless extension candidates. Maximal degree in co-relation 274. Up to 74 conditions per place. [2023-08-30 16:49:20,030 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-30 16:49:20,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 146 flow [2023-08-30 16:49:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:49:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:49:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-30 16:49:20,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018518518518519 [2023-08-30 16:49:20,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-30 16:49:20,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-30 16:49:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:20,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-30 16:49:20,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:49:20,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:49:20,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:49:20,035 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 78 flow. Second operand 3 states and 271 transitions. [2023-08-30 16:49:20,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 146 flow [2023-08-30 16:49:20,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 134 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 16:49:20,037 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 85 flow [2023-08-30 16:49:20,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-30 16:49:20,040 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-30 16:49:20,040 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 85 flow [2023-08-30 16:49:20,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:49:20,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:20,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:20,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:49:20,041 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:49:20,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1161190328, now seen corresponding path program 1 times [2023-08-30 16:49:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632842318] [2023-08-30 16:49:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:20,266 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:49:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632842318] [2023-08-30 16:49:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632842318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:49:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527558297] [2023-08-30 16:49:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:20,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:49:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:49:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:49:20,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-30 16:49:20,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:49:20,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:20,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-30 16:49:20,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:20,319 INFO L130 PetriNetUnfolder]: 19/63 cut-off events. [2023-08-30 16:49:20,319 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:49:20,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 63 events. 19/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 10 based on Foata normal form. 8/69 useless extension candidates. Maximal degree in co-relation 161. Up to 31 conditions per place. [2023-08-30 16:49:20,320 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 19 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-08-30 16:49:20,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 149 flow [2023-08-30 16:49:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:49:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:49:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2023-08-30 16:49:20,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49027777777777776 [2023-08-30 16:49:20,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 353 transitions. [2023-08-30 16:49:20,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 353 transitions. [2023-08-30 16:49:20,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:20,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 353 transitions. [2023-08-30 16:49:20,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:49:20,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 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:49:20,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 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:49:20,325 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 85 flow. Second operand 4 states and 353 transitions. [2023-08-30 16:49:20,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 149 flow [2023-08-30 16:49:20,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 134 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 16:49:20,326 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 86 flow [2023-08-30 16:49:20,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-08-30 16:49:20,327 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-30 16:49:20,327 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 86 flow [2023-08-30 16:49:20,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:49:20,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:20,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:20,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:49:20,328 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:49:20,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash -265593537, now seen corresponding path program 1 times [2023-08-30 16:49:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904369124] [2023-08-30 16:49:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:20,870 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:49:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904369124] [2023-08-30 16:49:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904369124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:49:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044714620] [2023-08-30 16:49:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:49:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:20,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:49:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:49:20,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 180 [2023-08-30 16:49:20,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:20,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:20,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 180 [2023-08-30 16:49:20,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:21,068 INFO L130 PetriNetUnfolder]: 36/98 cut-off events. [2023-08-30 16:49:21,068 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-30 16:49:21,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 98 events. 36/98 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 257 event pairs, 4 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 264. Up to 38 conditions per place. [2023-08-30 16:49:21,069 INFO L137 encePairwiseOnDemand]: 171/180 looper letters, 27 selfloop transitions, 8 changer transitions 13/48 dead transitions. [2023-08-30 16:49:21,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 278 flow [2023-08-30 16:49:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:49:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:49:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 693 transitions. [2023-08-30 16:49:21,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2023-08-30 16:49:21,072 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 693 transitions. [2023-08-30 16:49:21,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 693 transitions. [2023-08-30 16:49:21,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:21,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 693 transitions. [2023-08-30 16:49:21,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.0) internal successors, (693), 9 states have internal predecessors, (693), 0 states have call successors, (0), 0 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:49:21,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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:49:21,077 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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:49:21,077 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 86 flow. Second operand 9 states and 693 transitions. [2023-08-30 16:49:21,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 278 flow [2023-08-30 16:49:21,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 258 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:21,079 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 109 flow [2023-08-30 16:49:21,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-30 16:49:21,080 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2023-08-30 16:49:21,080 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 109 flow [2023-08-30 16:49:21,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:21,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:21,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:21,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:49:21,082 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:49:21,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 888068655, now seen corresponding path program 2 times [2023-08-30 16:49:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:21,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312754599] [2023-08-30 16:49:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:21,318 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:49:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:21,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312754599] [2023-08-30 16:49:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312754599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:21,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:21,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:49:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620980536] [2023-08-30 16:49:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:21,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:49:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:49:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:49:21,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 180 [2023-08-30 16:49:21,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 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:49:21,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:21,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 180 [2023-08-30 16:49:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:21,419 INFO L130 PetriNetUnfolder]: 27/93 cut-off events. [2023-08-30 16:49:21,419 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-30 16:49:21,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 93 events. 27/93 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 287 event pairs, 11 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 278. Up to 38 conditions per place. [2023-08-30 16:49:21,420 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 17 selfloop transitions, 1 changer transitions 18/38 dead transitions. [2023-08-30 16:49:21,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 239 flow [2023-08-30 16:49:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:49:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:49:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2023-08-30 16:49:21,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2023-08-30 16:49:21,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2023-08-30 16:49:21,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2023-08-30 16:49:21,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:21,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2023-08-30 16:49:21,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 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:49:21,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:21,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:49:21,428 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 109 flow. Second operand 5 states and 429 transitions. [2023-08-30 16:49:21,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 239 flow [2023-08-30 16:49:21,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 213 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-30 16:49:21,430 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 84 flow [2023-08-30 16:49:21,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2023-08-30 16:49:21,432 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2023-08-30 16:49:21,432 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 84 flow [2023-08-30 16:49:21,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 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:49:21,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:21,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:21,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:49:21,433 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:49:21,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash -157717151, now seen corresponding path program 3 times [2023-08-30 16:49:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813145229] [2023-08-30 16:49:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:49:21,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:49:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:49:21,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:49:21,570 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:49:21,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:49:21,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:49:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:49:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:49:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:49:21,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:49:21,577 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:21,582 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:49:21,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:49:21,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:49:21 BasicIcfg [2023-08-30 16:49:21,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:49:21,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:49:21,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:49:21,630 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:49:21,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:14" (3/4) ... [2023-08-30 16:49:21,632 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:49:21,698 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:49:21,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:49:21,701 INFO L158 Benchmark]: Toolchain (without parser) took 7977.25ms. Allocated memory was 71.3MB in the beginning and 167.8MB in the end (delta: 96.5MB). Free memory was 48.0MB in the beginning and 128.4MB in the end (delta: -80.4MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,701 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:49:21,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.63ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 45.2MB in the end (delta: 2.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.62ms. Allocated memory is still 71.3MB. Free memory was 45.2MB in the beginning and 43.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,702 INFO L158 Benchmark]: Boogie Preprocessor took 23.97ms. Allocated memory is still 71.3MB. Free memory was 42.7MB in the beginning and 40.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,702 INFO L158 Benchmark]: RCFGBuilder took 667.26ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 30.8MB in the end (delta: 10.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,702 INFO L158 Benchmark]: TraceAbstraction took 6765.35ms. Allocated memory was 71.3MB in the beginning and 167.8MB in the end (delta: 96.5MB). Free memory was 30.2MB in the beginning and 135.8MB in the end (delta: -105.6MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,702 INFO L158 Benchmark]: Witness Printer took 70.53ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 128.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 16:49:21,704 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 was 36.6MB in the beginning and 36.5MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.63ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 45.2MB in the end (delta: 2.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.62ms. Allocated memory is still 71.3MB. Free memory was 45.2MB in the beginning and 43.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.97ms. Allocated memory is still 71.3MB. Free memory was 42.7MB in the beginning and 40.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 667.26ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 30.8MB in the end (delta: 10.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6765.35ms. Allocated memory was 71.3MB in the beginning and 167.8MB in the end (delta: 96.5MB). Free memory was 30.2MB in the beginning and 135.8MB in the end (delta: -105.6MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 70.53ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 128.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 99 PlacesBefore, 28 PlacesAfterwards, 94 TransitionsBefore, 22 TransitionsAfterwards, 1346 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 3560 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1782, independent: 1634, independent conditional: 0, independent unconditional: 1634, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 778, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1782, independent: 880, independent conditional: 0, independent unconditional: 880, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 778, unknown conditional: 0, unknown unconditional: 778] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-1, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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, 118 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: 6.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 41 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 39, 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, 1.8s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:49:21,729 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