./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --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:23,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:49:23,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:49:23,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:49:23,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:49:23,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:49:23,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:49:23,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:49:23,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:49:23,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:49:23,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:49:23,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:49:23,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:49:23,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:49:23,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:49:23,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:49:23,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:49:23,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:49:23,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:49:23,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:49:23,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:49:23,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:49:23,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:49:23,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:49:23,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:49:23,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:49:23,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:49:23,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:49:23,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:49:23,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:49:23,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:49:23,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:49:23,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:49:23,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:49:23,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:49:23,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:49:23,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:49:23,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:49:23,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:49:23,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:49:23,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:49:23,946 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:23,974 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:49:23,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:49:23,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:49:23,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:49:23,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:49:23,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:49:23,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:49:23,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:49:23,979 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:49:23,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:49:23,979 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:49:23,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:49:23,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:49:23,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:49:23,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:49:23,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:49:23,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:49:23,980 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:49:23,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:49:23,981 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:49:23,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:49:23,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:49:23,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:49:23,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:49:23,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:49:23,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:49:23,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:49:23,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:49:23,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:49:23,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:49:23,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:49:23,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:49:23,983 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:49:23,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:49:23,983 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:49:23,983 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 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:24,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:49:24,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:49:24,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:49:24,283 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:49:24,283 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:49:24,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-08-30 16:49:25,509 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:49:25,771 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:49:25,772 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-08-30 16:49:25,782 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1587a6e/52cc4181616d42b390763a0a67297870/FLAG65c755cc3 [2023-08-30 16:49:25,795 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1587a6e/52cc4181616d42b390763a0a67297870 [2023-08-30 16:49:25,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:49:25,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:49:25,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:49:25,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:49:25,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:49:25,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:49:25" (1/1) ... [2023-08-30 16:49:25,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edb285c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:25, skipping insertion in model container [2023-08-30 16:49:25,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:49:25" (1/1) ... [2023-08-30 16:49:25,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:49:25,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:49:25,971 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.opt.i[987,1000] [2023-08-30 16:49:26,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:49:26,130 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:49:26,141 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.opt.i[987,1000] [2023-08-30 16:49:26,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:49:26,254 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:49:26,254 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:49:26,259 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:49:26,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:26 WrapperNode [2023-08-30 16:49:26,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:49:26,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:49:26,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:49:26,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:49:26,267 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:26" (1/1) ... [2023-08-30 16:49:26,295 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:26" (1/1) ... [2023-08-30 16:49:26,324 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-08-30 16:49:26,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:49:26,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:49:26,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:49:26,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:49:26,332 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:26" (1/1) ... [2023-08-30 16:49:26,333 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:26" (1/1) ... [2023-08-30 16:49:26,348 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:26" (1/1) ... [2023-08-30 16:49:26,349 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:26" (1/1) ... [2023-08-30 16:49:26,353 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:26" (1/1) ... [2023-08-30 16:49:26,364 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:26" (1/1) ... [2023-08-30 16:49:26,365 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:26" (1/1) ... [2023-08-30 16:49:26,374 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:26" (1/1) ... [2023-08-30 16:49:26,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:49:26,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:49:26,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:49:26,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:49:26,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:26" (1/1) ... [2023-08-30 16:49:26,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:49:26,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:49:26,404 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:26,427 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:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:49:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:49:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:49:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:49:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:49:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:49:26,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:49:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:49:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:49:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:49:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:49:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:49:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:49:26,444 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:26,632 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:49:26,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:49:26,871 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:49:27,049 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:49:27,049 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:49:27,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:27 BoogieIcfgContainer [2023-08-30 16:49:27,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:49:27,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:49:27,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:49:27,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:49:27,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:49:25" (1/3) ... [2023-08-30 16:49:27,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c197d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:49:27, skipping insertion in model container [2023-08-30 16:49:27,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:26" (2/3) ... [2023-08-30 16:49:27,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c197d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:49:27, skipping insertion in model container [2023-08-30 16:49:27,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:27" (3/3) ... [2023-08-30 16:49:27,058 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-08-30 16:49:27,064 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:49:27,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:49:27,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:49:27,073 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:49:27,126 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:49:27,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2023-08-30 16:49:27,242 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-30 16:49:27,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:49:27,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-30 16:49:27,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2023-08-30 16:49:27,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-08-30 16:49:27,252 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:49:27,261 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-30 16:49:27,263 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-30 16:49:27,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-08-30 16:49:27,282 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-30 16:49:27,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:49:27,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-30 16:49:27,284 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-08-30 16:49:30,492 INFO L134 LiptonReduction]: Checked pairs total: 2778 [2023-08-30 16:49:30,493 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-08-30 16:49:30,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:49:30,509 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;@7b5c4efb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:49:30,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:49:30,514 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 16:49:30,514 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:49:30,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:30,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:49:30,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:30,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash 400970686, now seen corresponding path program 1 times [2023-08-30 16:49:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78417787] [2023-08-30 16:49:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:30,873 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:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78417787] [2023-08-30 16:49:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78417787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:30,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:30,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:49:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398276323] [2023-08-30 16:49:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:30,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:49:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:30,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:49:30,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:49:30,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 183 [2023-08-30 16:49:30,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:30,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:30,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 183 [2023-08-30 16:49:30,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:31,037 INFO L130 PetriNetUnfolder]: 144/305 cut-off events. [2023-08-30 16:49:31,038 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 16:49:31,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 305 events. 144/305 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1297 event pairs, 24 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 566. Up to 196 conditions per place. [2023-08-30 16:49:31,043 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-08-30 16:49:31,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 102 flow [2023-08-30 16:49:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:49:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:49:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-08-30 16:49:31,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027322404371585 [2023-08-30 16:49:31,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-08-30 16:49:31,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-08-30 16:49:31,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:31,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-08-30 16:49:31,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:31,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:31,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:31,077 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 276 transitions. [2023-08-30 16:49:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 102 flow [2023-08-30 16:49:31,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:31,088 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-08-30 16:49:31,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-30 16:49:31,092 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:49:31,092 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-08-30 16:49:31,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:31,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:31,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:31,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:49:31,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:31,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1214164090, now seen corresponding path program 1 times [2023-08-30 16:49:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471040034] [2023-08-30 16:49:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:31,384 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:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:31,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471040034] [2023-08-30 16:49:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471040034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:31,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:31,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:49:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017715762] [2023-08-30 16:49:31,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:31,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:49:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:49:31,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:49:31,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-08-30 16:49:31,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:31,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:31,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-08-30 16:49:31,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:31,493 INFO L130 PetriNetUnfolder]: 167/294 cut-off events. [2023-08-30 16:49:31,493 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:49:31,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 963 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-08-30 16:49:31,498 INFO L137 encePairwiseOnDemand]: 179/183 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-30 16:49:31,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-08-30 16:49:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:49:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:49:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-08-30 16:49:31,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47176684881602915 [2023-08-30 16:49:31,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-08-30 16:49:31,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-08-30 16:49:31,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:31,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-08-30 16:49:31,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:31,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:31,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:31,504 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 259 transitions. [2023-08-30 16:49:31,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-08-30 16:49:31,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:31,506 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-08-30 16:49:31,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-30 16:49:31,507 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:49:31,507 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-08-30 16:49:31,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:31,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:31,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:31,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:49:31,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:31,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1963568488, now seen corresponding path program 1 times [2023-08-30 16:49:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963451015] [2023-08-30 16:49:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:31,733 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:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963451015] [2023-08-30 16:49:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963451015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:49:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587882573] [2023-08-30 16:49:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:31,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:49:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:49:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:49:31,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-08-30 16:49:31,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:31,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:31,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-08-30 16:49:31,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:31,833 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-08-30 16:49:31,834 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-08-30 16:49:31,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 278 events. 157/278 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 877 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 635. Up to 200 conditions per place. [2023-08-30 16:49:31,835 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-30 16:49:31,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 111 flow [2023-08-30 16:49:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:49:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:49:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-08-30 16:49:31,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681238615664845 [2023-08-30 16:49:31,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-08-30 16:49:31,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-08-30 16:49:31,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:31,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-08-30 16:49:31,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:31,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:31,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:31,841 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 257 transitions. [2023-08-30 16:49:31,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 111 flow [2023-08-30 16:49:31,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:49:31,842 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-08-30 16:49:31,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-30 16:49:31,843 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-08-30 16:49:31,843 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-08-30 16:49:31,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:31,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:31,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:31,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:49:31,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:31,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1418155052, now seen corresponding path program 1 times [2023-08-30 16:49:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236077426] [2023-08-30 16:49:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:32,054 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:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:32,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236077426] [2023-08-30 16:49:32,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236077426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:49:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943289808] [2023-08-30 16:49:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:32,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:49:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:49:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:49:32,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-08-30 16:49:32,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:32,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:32,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-08-30 16:49:32,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:32,160 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-08-30 16:49:32,160 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2023-08-30 16:49:32,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 256 events. 143/256 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 806 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 607. Up to 177 conditions per place. [2023-08-30 16:49:32,162 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-30 16:49:32,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 133 flow [2023-08-30 16:49:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:49:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:49:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-08-30 16:49:32,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47358834244080145 [2023-08-30 16:49:32,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-08-30 16:49:32,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-08-30 16:49:32,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:32,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-08-30 16:49:32,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:32,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:32,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:32,170 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 260 transitions. [2023-08-30 16:49:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 133 flow [2023-08-30 16:49:32,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:32,173 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-08-30 16:49:32,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 16:49:32,174 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-08-30 16:49:32,174 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-08-30 16:49:32,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:32,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:32,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:32,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:49:32,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:32,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1536345284, now seen corresponding path program 1 times [2023-08-30 16:49:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840896091] [2023-08-30 16:49:32,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:32,388 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:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:32,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840896091] [2023-08-30 16:49:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840896091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:32,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:49:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155489973] [2023-08-30 16:49:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:49:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:49:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:49:32,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 183 [2023-08-30 16:49:32,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:32,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:32,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 183 [2023-08-30 16:49:32,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:32,481 INFO L130 PetriNetUnfolder]: 65/146 cut-off events. [2023-08-30 16:49:32,481 INFO L131 PetriNetUnfolder]: For 57/58 co-relation queries the response was YES. [2023-08-30 16:49:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 146 events. 65/146 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 482 event pairs, 14 based on Foata normal form. 23/167 useless extension candidates. Maximal degree in co-relation 355. Up to 58 conditions per place. [2023-08-30 16:49:32,482 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 21 selfloop transitions, 3 changer transitions 16/43 dead transitions. [2023-08-30 16:49:32,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 220 flow [2023-08-30 16:49:32,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:49:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:49:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2023-08-30 16:49:32,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48633879781420764 [2023-08-30 16:49:32,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 445 transitions. [2023-08-30 16:49:32,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 445 transitions. [2023-08-30 16:49:32,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:32,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 445 transitions. [2023-08-30 16:49:32,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:32,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:32,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:32,488 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 5 states and 445 transitions. [2023-08-30 16:49:32,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 220 flow [2023-08-30 16:49:32,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:49:32,490 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 89 flow [2023-08-30 16:49:32,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, 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=89, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-08-30 16:49:32,491 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-08-30 16:49:32,491 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 89 flow [2023-08-30 16:49:32,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:32,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:32,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:32,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:49:32,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:32,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:32,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1385869629, now seen corresponding path program 1 times [2023-08-30 16:49:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:32,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709338565] [2023-08-30 16:49:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:32,764 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:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709338565] [2023-08-30 16:49:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709338565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:49:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406752674] [2023-08-30 16:49:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:32,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:49:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:32,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:49:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:49:32,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 183 [2023-08-30 16:49:32,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:32,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:32,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 183 [2023-08-30 16:49:32,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:32,860 INFO L130 PetriNetUnfolder]: 27/75 cut-off events. [2023-08-30 16:49:32,860 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-30 16:49:32,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 75 events. 27/75 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 184 event pairs, 11 based on Foata normal form. 8/82 useless extension candidates. Maximal degree in co-relation 211. Up to 34 conditions per place. [2023-08-30 16:49:32,861 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 19 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-08-30 16:49:32,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 201 flow [2023-08-30 16:49:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:49:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:49:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2023-08-30 16:49:32,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726775956284153 [2023-08-30 16:49:32,863 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 519 transitions. [2023-08-30 16:49:32,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 519 transitions. [2023-08-30 16:49:32,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:32,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 519 transitions. [2023-08-30 16:49:32,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 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:32,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:32,867 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:32,867 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 89 flow. Second operand 6 states and 519 transitions. [2023-08-30 16:49:32,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 201 flow [2023-08-30 16:49:32,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 174 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-30 16:49:32,869 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 88 flow [2023-08-30 16:49:32,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-30 16:49:32,870 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-08-30 16:49:32,870 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 88 flow [2023-08-30 16:49:32,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:32,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:32,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:49:32,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:32,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -592842891, now seen corresponding path program 1 times [2023-08-30 16:49:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595165353] [2023-08-30 16:49:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:33,264 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:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595165353] [2023-08-30 16:49:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595165353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:33,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:33,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:49:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162506499] [2023-08-30 16:49:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:33,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:49:33,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:33,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:49:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:49:33,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-08-30 16:49:33,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 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:33,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:33,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-08-30 16:49:33,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:33,403 INFO L130 PetriNetUnfolder]: 37/104 cut-off events. [2023-08-30 16:49:33,404 INFO L131 PetriNetUnfolder]: For 87/88 co-relation queries the response was YES. [2023-08-30 16:49:33,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 104 events. 37/104 cut-off events. For 87/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 333 event pairs, 0 based on Foata normal form. 2/105 useless extension candidates. Maximal degree in co-relation 284. Up to 49 conditions per place. [2023-08-30 16:49:33,405 INFO L137 encePairwiseOnDemand]: 177/183 looper letters, 18 selfloop transitions, 1 changer transitions 24/44 dead transitions. [2023-08-30 16:49:33,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 275 flow [2023-08-30 16:49:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:49:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:49:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2023-08-30 16:49:33,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465391621129326 [2023-08-30 16:49:33,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2023-08-30 16:49:33,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2023-08-30 16:49:33,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:33,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2023-08-30 16:49:33,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:33,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:33,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:33,412 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 88 flow. Second operand 6 states and 511 transitions. [2023-08-30 16:49:33,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 275 flow [2023-08-30 16:49:33,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 242 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 16:49:33,415 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 81 flow [2023-08-30 16:49:33,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-08-30 16:49:33,416 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-08-30 16:49:33,416 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 81 flow [2023-08-30 16:49:33,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 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:33,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:33,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:49:33,417 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:33,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1806005681, now seen corresponding path program 2 times [2023-08-30 16:49:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631316336] [2023-08-30 16:49:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:49:33,795 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:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:49:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631316336] [2023-08-30 16:49:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631316336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:49:33,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:49:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:49:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754717966] [2023-08-30 16:49:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:49:33,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:49:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:49:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:49:33,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:49:33,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-08-30 16:49:33,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 81 flow. Second operand has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:33,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:33,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-08-30 16:49:33,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:33,892 INFO L130 PetriNetUnfolder]: 10/47 cut-off events. [2023-08-30 16:49:33,893 INFO L131 PetriNetUnfolder]: For 46/47 co-relation queries the response was YES. [2023-08-30 16:49:33,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 47 events. 10/47 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 2 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 152. Up to 17 conditions per place. [2023-08-30 16:49:33,893 INFO L137 encePairwiseOnDemand]: 177/183 looper letters, 13 selfloop transitions, 4 changer transitions 10/29 dead transitions. [2023-08-30 16:49:33,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 189 flow [2023-08-30 16:49:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:49:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:49:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 577 transitions. [2023-08-30 16:49:33,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45042935206869633 [2023-08-30 16:49:33,896 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 577 transitions. [2023-08-30 16:49:33,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 577 transitions. [2023-08-30 16:49:33,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:33,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 577 transitions. [2023-08-30 16:49:33,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.42857142857143) internal successors, (577), 7 states have internal predecessors, (577), 0 states have call successors, (0), 0 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:33,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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:33,900 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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:33,900 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 81 flow. Second operand 7 states and 577 transitions. [2023-08-30 16:49:33,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 189 flow [2023-08-30 16:49:33,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 176 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 16:49:33,901 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 86 flow [2023-08-30 16:49:33,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2023-08-30 16:49:33,902 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2023-08-30 16:49:33,902 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 86 flow [2023-08-30 16:49:33,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:33,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:33,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:33,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:49:33,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:49:33,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1360483241, now seen corresponding path program 3 times [2023-08-30 16:49:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:33,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763331562] [2023-08-30 16:49:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:49:33,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:49:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:49:33,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:49:33,973 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:49:33,974 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:49:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:49:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:49:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:49:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:49:33,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:49:33,976 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:33,981 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:49:33,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:49:34,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:49:34 BasicIcfg [2023-08-30 16:49:34,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:49:34,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:49:34,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:49:34,018 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:49:34,018 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:27" (3/4) ... [2023-08-30 16:49:34,020 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:49:34,084 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:49:34,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:49:34,085 INFO L158 Benchmark]: Toolchain (without parser) took 8286.57ms. Allocated memory was 75.5MB in the beginning and 182.5MB in the end (delta: 107.0MB). Free memory was 48.7MB in the beginning and 72.0MB in the end (delta: -23.3MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:34,085 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:49:34,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.12ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 49.6MB in the end (delta: -1.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-08-30 16:49:34,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.09ms. Allocated memory is still 75.5MB. Free memory was 49.6MB in the beginning and 47.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:49:34,086 INFO L158 Benchmark]: Boogie Preprocessor took 51.87ms. Allocated memory is still 75.5MB. Free memory was 47.2MB in the beginning and 45.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:49:34,086 INFO L158 Benchmark]: RCFGBuilder took 674.18ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 39.1MB in the end (delta: 6.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-08-30 16:49:34,086 INFO L158 Benchmark]: TraceAbstraction took 6963.97ms. Allocated memory was 75.5MB in the beginning and 182.5MB in the end (delta: 107.0MB). Free memory was 38.4MB in the beginning and 79.3MB in the end (delta: -40.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:34,086 INFO L158 Benchmark]: Witness Printer took 66.77ms. Allocated memory is still 182.5MB. Free memory was 79.3MB in the beginning and 72.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 16:49:34,088 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.20ms. Allocated memory is still 52.4MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.12ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 49.6MB in the end (delta: -1.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.09ms. Allocated memory is still 75.5MB. Free memory was 49.6MB in the beginning and 47.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.87ms. Allocated memory is still 75.5MB. Free memory was 47.2MB in the beginning and 45.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 674.18ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 39.1MB in the end (delta: 6.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6963.97ms. Allocated memory was 75.5MB in the beginning and 182.5MB in the end (delta: 107.0MB). Free memory was 38.4MB in the beginning and 79.3MB in the end (delta: -40.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 66.77ms. Allocated memory is still 182.5MB. Free memory was 79.3MB in the beginning and 72.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 98 PlacesBefore, 25 PlacesAfterwards, 93 TransitionsBefore, 18 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 2778 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1466, independent: 1346, independent conditional: 0, independent unconditional: 1346, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 677, independent conditional: 0, independent unconditional: 677, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1466, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((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=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=-1, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 826]: 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: 824]: 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, 116 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.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 38 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=5, InterpolantAutomatonStates: 36, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 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:34,118 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