/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:58:52,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:58:52,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:58:52,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:58:52,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:58:52,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:58:53,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:58:53,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:58:53,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:58:53,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:58:53,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:58:53,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:58:53,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:58:53,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:58:53,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:58:53,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:58:53,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:58:53,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:58:53,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:58:53,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:58:53,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:58:53,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:58:53,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:58:53,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:58:53,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:58:53,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:58:53,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:58:53,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:58:53,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:58:53,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:58:53,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:58:53,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:58:53,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:58:53,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:58:53,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:58:53,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:58:53,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:58:53,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:58:53,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:58:53,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:58:53,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:58:53,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:58:53,059 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:58:53,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:58:53,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:58:53,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:58:53,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:58:53,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:58:53,061 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:58:53,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:58:53,061 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:58:53,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:58:53,062 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:58:53,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:53,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:58:53,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:58:53,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:58:53,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:58:53,064 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:58:53,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:58:53,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:58:53,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:58:53,238 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:58:53,239 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:58:53,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 06:58:54,291 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:58:54,509 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:58:54,510 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 06:58:54,517 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b233a26/58cd3e9dc8dc40c1830961449bb612d1/FLAG7bbd6d3c8 [2023-01-28 06:58:54,897 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b233a26/58cd3e9dc8dc40c1830961449bb612d1 [2023-01-28 06:58:54,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:58:54,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:58:54,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:54,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:58:54,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:58:54,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:54" (1/1) ... [2023-01-28 06:58:54,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e606f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:54, skipping insertion in model container [2023-01-28 06:58:54,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:54" (1/1) ... [2023-01-28 06:58:54,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:58:54,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:58:55,084 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-01-28 06:58:55,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:55,253 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:58:55,262 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-01-28 06:58:55,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:55,322 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:55,323 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:55,328 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:58:55,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55 WrapperNode [2023-01-28 06:58:55,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:55,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:55,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:58:55,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:58:55,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,401 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-01-28 06:58:55,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:55,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:58:55,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:58:55,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:58:55,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,435 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:58:55,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:58:55,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:58:55,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:58:55,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (1/1) ... [2023-01-28 06:58:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:58:55,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:58:55,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:58:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:58:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:58:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:58:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:58:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:58:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:58:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:58:55,516 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:58:55,597 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:58:55,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:58:55,878 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:58:55,976 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:58:55,976 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:58:55,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:55 BoogieIcfgContainer [2023-01-28 06:58:55,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:58:55,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:58:55,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:58:55,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:58:55,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:58:54" (1/3) ... [2023-01-28 06:58:55,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f331519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:55, skipping insertion in model container [2023-01-28 06:58:55,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:55" (2/3) ... [2023-01-28 06:58:55,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f331519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:55, skipping insertion in model container [2023-01-28 06:58:55,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:55" (3/3) ... [2023-01-28 06:58:55,983 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 06:58:55,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:58:55,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:58:55,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:58:56,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:58:56,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2023-01-28 06:58:56,107 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-01-28 06:58:56,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:56,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-28 06:58:56,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2023-01-28 06:58:56,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:56,117 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:58:56,127 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:56,130 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:56,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:56,158 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-01-28 06:58:56,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:56,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-28 06:58:56,160 INFO L119 LiptonReduction]: Number of co-enabled transitions 1068 [2023-01-28 06:58:58,581 INFO L134 LiptonReduction]: Checked pairs total: 2914 [2023-01-28 06:58:58,581 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-01-28 06:58:58,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:58:58,594 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3cc348a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:58:58,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:58:58,597 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 06:58:58,597 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:58,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:58,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:58:58,597 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-01-28 06:58:58,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 383109091, now seen corresponding path program 1 times [2023-01-28 06:58:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244218888] [2023-01-28 06:58:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244218888] [2023-01-28 06:58:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244218888] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:58,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:58,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624192480] [2023-01-28 06:58:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:58,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:58,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 171 [2023-01-28 06:58:58,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:58,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:58,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 171 [2023-01-28 06:58:58,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:58,952 INFO L130 PetriNetUnfolder]: 111/260 cut-off events. [2023-01-28 06:58:58,953 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 06:58:58,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 260 events. 111/260 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1108 event pairs, 18 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 464. Up to 154 conditions per place. [2023-01-28 06:58:58,956 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 17 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-01-28 06:58:58,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 96 flow [2023-01-28 06:58:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2023-01-28 06:58:58,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-01-28 06:58:58,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 261 transitions. [2023-01-28 06:58:58,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions. [2023-01-28 06:58:58,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:58,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions. [2023-01-28 06:58:58,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:58,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:58,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:58,982 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 261 transitions. [2023-01-28 06:58:58,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 96 flow [2023-01-28 06:58:58,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:58,985 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-01-28 06:58:58,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, 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-01-28 06:58:58,989 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 06:58:58,989 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-01-28 06:58:58,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:58,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:58,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:58,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:58:58,990 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-01-28 06:58:58,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1199295244, now seen corresponding path program 1 times [2023-01-28 06:58:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362595874] [2023-01-28 06:58:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362595874] [2023-01-28 06:58:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362595874] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684566465] [2023-01-28 06:58:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:59,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 171 [2023-01-28 06:58:59,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:59,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 171 [2023-01-28 06:58:59,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:59,363 INFO L130 PetriNetUnfolder]: 204/378 cut-off events. [2023-01-28 06:58:59,363 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 06:58:59,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 378 events. 204/378 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1590 event pairs, 56 based on Foata normal form. 22/400 useless extension candidates. Maximal degree in co-relation 775. Up to 209 conditions per place. [2023-01-28 06:58:59,367 INFO L137 encePairwiseOnDemand]: 164/171 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-01-28 06:58:59,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 124 flow [2023-01-28 06:58:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-01-28 06:58:59,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47173489278752434 [2023-01-28 06:58:59,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-01-28 06:58:59,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-01-28 06:58:59,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:59,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-01-28 06:58:59,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,372 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 242 transitions. [2023-01-28 06:58:59,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 124 flow [2023-01-28 06:58:59,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:59,373 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2023-01-28 06:58:59,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2023-01-28 06:58:59,374 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-01-28 06:58:59,374 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2023-01-28 06:58:59,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:59,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:59,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:58:59,375 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-01-28 06:58:59,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1476552379, now seen corresponding path program 1 times [2023-01-28 06:58:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674470225] [2023-01-28 06:58:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:59,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674470225] [2023-01-28 06:58:59,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674470225] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971579843] [2023-01-28 06:58:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:59,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:59,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 171 [2023-01-28 06:58:59,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:59,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 171 [2023-01-28 06:58:59,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:59,608 INFO L130 PetriNetUnfolder]: 159/312 cut-off events. [2023-01-28 06:58:59,608 INFO L131 PetriNetUnfolder]: For 145/146 co-relation queries the response was YES. [2023-01-28 06:58:59,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 312 events. 159/312 cut-off events. For 145/146 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1197 event pairs, 65 based on Foata normal form. 10/315 useless extension candidates. Maximal degree in co-relation 792. Up to 206 conditions per place. [2023-01-28 06:58:59,612 INFO L137 encePairwiseOnDemand]: 168/171 looper letters, 16 selfloop transitions, 3 changer transitions 3/26 dead transitions. [2023-01-28 06:58:59,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 144 flow [2023-01-28 06:58:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2023-01-28 06:58:59,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48927875243664715 [2023-01-28 06:58:59,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2023-01-28 06:58:59,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2023-01-28 06:58:59,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:59,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2023-01-28 06:58:59,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,615 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 3 states and 251 transitions. [2023-01-28 06:58:59,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 144 flow [2023-01-28 06:58:59,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:59,618 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 77 flow [2023-01-28 06:58:59,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-01-28 06:58:59,619 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-01-28 06:58:59,621 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 77 flow [2023-01-28 06:58:59,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:59,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:59,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:58:59,622 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-01-28 06:58:59,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1537694994, now seen corresponding path program 1 times [2023-01-28 06:58:59,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:59,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039351233] [2023-01-28 06:58:59,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:59,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039351233] [2023-01-28 06:58:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039351233] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:59,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:58:59,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311229564] [2023-01-28 06:58:59,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:59,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:59,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:59,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 171 [2023-01-28 06:58:59,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:59,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 171 [2023-01-28 06:58:59,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:59,840 INFO L130 PetriNetUnfolder]: 177/324 cut-off events. [2023-01-28 06:58:59,841 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-01-28 06:58:59,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 324 events. 177/324 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1172 event pairs, 66 based on Foata normal form. 3/327 useless extension candidates. Maximal degree in co-relation 830. Up to 153 conditions per place. [2023-01-28 06:58:59,842 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 22 selfloop transitions, 5 changer transitions 4/31 dead transitions. [2023-01-28 06:58:59,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 167 flow [2023-01-28 06:58:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2023-01-28 06:58:59,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2023-01-28 06:58:59,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 312 transitions. [2023-01-28 06:58:59,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 312 transitions. [2023-01-28 06:58:59,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:59,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 312 transitions. [2023-01-28 06:58:59,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,851 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,852 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 77 flow. Second operand 4 states and 312 transitions. [2023-01-28 06:58:59,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 167 flow [2023-01-28 06:58:59,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:59,853 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 96 flow [2023-01-28 06:58:59,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-01-28 06:58:59,854 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2023-01-28 06:58:59,855 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 96 flow [2023-01-28 06:58:59,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:59,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:59,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:59,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:58:59,855 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-01-28 06:58:59,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1710066603, now seen corresponding path program 1 times [2023-01-28 06:58:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224252203] [2023-01-28 06:58:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:59:00,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:00,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224252203] [2023-01-28 06:59:00,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224252203] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:00,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:59:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174361180] [2023-01-28 06:59:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:00,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:59:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:59:00,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:59:00,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 171 [2023-01-28 06:59:00,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:00,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 171 [2023-01-28 06:59:00,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:00,139 INFO L130 PetriNetUnfolder]: 78/191 cut-off events. [2023-01-28 06:59:00,139 INFO L131 PetriNetUnfolder]: For 106/107 co-relation queries the response was YES. [2023-01-28 06:59:00,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 191 events. 78/191 cut-off events. For 106/107 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 768 event pairs, 13 based on Foata normal form. 32/223 useless extension candidates. Maximal degree in co-relation 503. Up to 84 conditions per place. [2023-01-28 06:59:00,141 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 20 selfloop transitions, 4 changer transitions 16/46 dead transitions. [2023-01-28 06:59:00,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 268 flow [2023-01-28 06:59:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:59:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:59:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2023-01-28 06:59:00,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47485380116959064 [2023-01-28 06:59:00,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 406 transitions. [2023-01-28 06:59:00,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 406 transitions. [2023-01-28 06:59:00,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:00,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 406 transitions. [2023-01-28 06:59:00,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,146 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,147 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 96 flow. Second operand 5 states and 406 transitions. [2023-01-28 06:59:00,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 268 flow [2023-01-28 06:59:00,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 251 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-28 06:59:00,152 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 118 flow [2023-01-28 06:59:00,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-01-28 06:59:00,154 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-01-28 06:59:00,154 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 118 flow [2023-01-28 06:59:00,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:00,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:00,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:59:00,155 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-01-28 06:59:00,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2002910037, now seen corresponding path program 1 times [2023-01-28 06:59:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087478461] [2023-01-28 06:59:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:59:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087478461] [2023-01-28 06:59:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087478461] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:00,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:59:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299962333] [2023-01-28 06:59:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:00,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:59:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:59:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:59:00,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 171 [2023-01-28 06:59:00,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:00,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 171 [2023-01-28 06:59:00,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:00,501 INFO L130 PetriNetUnfolder]: 138/317 cut-off events. [2023-01-28 06:59:00,501 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-01-28 06:59:00,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 317 events. 138/317 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1447 event pairs, 42 based on Foata normal form. 4/321 useless extension candidates. Maximal degree in co-relation 1115. Up to 128 conditions per place. [2023-01-28 06:59:00,502 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 28 selfloop transitions, 4 changer transitions 14/46 dead transitions. [2023-01-28 06:59:00,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 317 flow [2023-01-28 06:59:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:59:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:59:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2023-01-28 06:59:00,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47953216374269003 [2023-01-28 06:59:00,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 328 transitions. [2023-01-28 06:59:00,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 328 transitions. [2023-01-28 06:59:00,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:00,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 328 transitions. [2023-01-28 06:59:00,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,507 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 118 flow. Second operand 4 states and 328 transitions. [2023-01-28 06:59:00,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 317 flow [2023-01-28 06:59:00,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 304 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 06:59:00,510 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 124 flow [2023-01-28 06:59:00,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-01-28 06:59:00,512 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-01-28 06:59:00,512 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 124 flow [2023-01-28 06:59:00,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:00,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:00,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:59:00,512 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-01-28 06:59:00,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1138683693, now seen corresponding path program 2 times [2023-01-28 06:59:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871788673] [2023-01-28 06:59:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:59:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871788673] [2023-01-28 06:59:00,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871788673] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:00,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:00,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:59:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718280463] [2023-01-28 06:59:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:00,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:59:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:59:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:59:00,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 171 [2023-01-28 06:59:00,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:00,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 171 [2023-01-28 06:59:00,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:00,788 INFO L130 PetriNetUnfolder]: 32/112 cut-off events. [2023-01-28 06:59:00,789 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-01-28 06:59:00,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 112 events. 32/112 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 399 event pairs, 9 based on Foata normal form. 18/130 useless extension candidates. Maximal degree in co-relation 371. Up to 48 conditions per place. [2023-01-28 06:59:00,789 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 17 selfloop transitions, 5 changer transitions 11/37 dead transitions. [2023-01-28 06:59:00,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 260 flow [2023-01-28 06:59:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:59:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:59:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2023-01-28 06:59:00,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619883040935672 [2023-01-28 06:59:00,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 474 transitions. [2023-01-28 06:59:00,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 474 transitions. [2023-01-28 06:59:00,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:00,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 474 transitions. [2023-01-28 06:59:00,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,795 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,795 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 124 flow. Second operand 6 states and 474 transitions. [2023-01-28 06:59:00,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 260 flow [2023-01-28 06:59:00,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 230 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:00,797 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 122 flow [2023-01-28 06:59:00,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2023-01-28 06:59:00,798 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2023-01-28 06:59:00,798 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 122 flow [2023-01-28 06:59:00,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:00,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:00,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:59:00,799 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-01-28 06:59:00,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1372899754, now seen corresponding path program 1 times [2023-01-28 06:59:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798452187] [2023-01-28 06:59:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:59:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798452187] [2023-01-28 06:59:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798452187] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:01,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:59:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123699167] [2023-01-28 06:59:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:01,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:59:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:59:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:59:01,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 171 [2023-01-28 06:59:01,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:01,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:01,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 171 [2023-01-28 06:59:01,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:01,230 INFO L130 PetriNetUnfolder]: 24/111 cut-off events. [2023-01-28 06:59:01,230 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2023-01-28 06:59:01,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 111 events. 24/111 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 424 event pairs, 9 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 395. Up to 57 conditions per place. [2023-01-28 06:59:01,231 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 16 selfloop transitions, 3 changer transitions 18/41 dead transitions. [2023-01-28 06:59:01,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 319 flow [2023-01-28 06:59:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:59:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:59:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2023-01-28 06:59:01,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4600389863547758 [2023-01-28 06:59:01,232 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 472 transitions. [2023-01-28 06:59:01,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions. [2023-01-28 06:59:01,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:01,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions. [2023-01-28 06:59:01,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:01,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:01,235 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:01,235 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 122 flow. Second operand 6 states and 472 transitions. [2023-01-28 06:59:01,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 319 flow [2023-01-28 06:59:01,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 274 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-01-28 06:59:01,237 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 125 flow [2023-01-28 06:59:01,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-01-28 06:59:01,238 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2023-01-28 06:59:01,238 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 125 flow [2023-01-28 06:59:01,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:59:01,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:01,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:59:01,239 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-01-28 06:59:01,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash 882851004, now seen corresponding path program 2 times [2023-01-28 06:59:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267417051] [2023-01-28 06:59:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:59:01,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:59:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:59:01,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:59:01,318 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:59:01,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:59:01,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:59:01,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:59:01,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:59:01,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:59:01,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:59:01,320 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-01-28 06:59:01,324 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:59:01,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:59:01,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:59:01 BasicIcfg [2023-01-28 06:59:01,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:59:01,373 INFO L158 Benchmark]: Toolchain (without parser) took 6472.75ms. Allocated memory was 681.6MB in the beginning and 817.9MB in the end (delta: 136.3MB). Free memory was 638.0MB in the beginning and 471.4MB in the end (delta: 166.6MB). Peak memory consumption was 304.7MB. Max. memory is 16.0GB. [2023-01-28 06:59:01,373 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 383.8MB. Free memory is still 331.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:59:01,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.95ms. Allocated memory is still 681.6MB. Free memory was 637.7MB in the beginning and 615.6MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:59:01,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.25ms. Allocated memory is still 681.6MB. Free memory was 615.6MB in the beginning and 613.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:59:01,374 INFO L158 Benchmark]: Boogie Preprocessor took 37.00ms. Allocated memory is still 681.6MB. Free memory was 613.2MB in the beginning and 611.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:59:01,374 INFO L158 Benchmark]: RCFGBuilder took 538.70ms. Allocated memory is still 681.6MB. Free memory was 611.5MB in the beginning and 581.1MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 06:59:01,374 INFO L158 Benchmark]: TraceAbstraction took 5393.35ms. Allocated memory was 681.6MB in the beginning and 817.9MB in the end (delta: 136.3MB). Free memory was 580.7MB in the beginning and 471.4MB in the end (delta: 109.3MB). Peak memory consumption was 246.0MB. Max. memory is 16.0GB. [2023-01-28 06:59:01,375 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.10ms. Allocated memory is still 383.8MB. Free memory is still 331.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 425.95ms. Allocated memory is still 681.6MB. Free memory was 637.7MB in the beginning and 615.6MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.25ms. Allocated memory is still 681.6MB. Free memory was 615.6MB in the beginning and 613.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.00ms. Allocated memory is still 681.6MB. Free memory was 613.2MB in the beginning and 611.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 538.70ms. Allocated memory is still 681.6MB. Free memory was 611.5MB in the beginning and 581.1MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 5393.35ms. Allocated memory was 681.6MB in the beginning and 817.9MB in the end (delta: 136.3MB). Free memory was 580.7MB in the beginning and 471.4MB in the end (delta: 109.3MB). Peak memory consumption was 246.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 93 PlacesBefore, 25 PlacesAfterwards, 88 TransitionsBefore, 19 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 2914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1116, independent: 963, independent conditional: 0, independent unconditional: 963, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 617, independent: 589, independent conditional: 0, independent unconditional: 589, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1116, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 617, unknown conditional: 0, unknown unconditional: 617] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=-1, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - 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: 814]: 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: 816]: 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, 109 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: 5.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 9 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=8, InterpolantAutomatonStates: 34, 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, 1.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 379 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-01-28 06:59:01,416 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...