/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 BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:36:25,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:36:25,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:36:25,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:36:25,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:36:25,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:36:25,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:36:25,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:36:25,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:36:25,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:36:25,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:36:25,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:36:25,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:36:25,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:36:25,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:36:25,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:36:25,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:36:25,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:36:25,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:36:25,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:36:25,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:36:25,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:36:25,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:36:25,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:36:25,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:36:25,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:36:25,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:36:25,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:36:25,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:36:25,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:36:25,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:36:25,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:36:25,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:36:25,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:36:25,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:36:25,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:36:25,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:36:25,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:36:25,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:36:25,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:36:25,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:36:25,111 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 00:36:25,133 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:36:25,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:36:25,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:36:25,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:36:25,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:36:25,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:36:25,134 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:36:25,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:36:25,135 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:36:25,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:36:25,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:36:25,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:36:25,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:36:25,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:36:25,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:36:25,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:36:25,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:36:25,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:36:25,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:36:25,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:36:25,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:36:25,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:36:25,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:36:25,137 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 -> BEFORE [2023-01-28 00:36:25,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:36:25,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:36:25,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:36:25,307 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:36:25,307 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:36:25,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:36:26,251 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:36:26,418 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:36:26,419 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:36:26,430 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d401320a7/172f5991efe84bb88de65996324c6e8c/FLAG99d084bc1 [2023-01-28 00:36:26,440 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d401320a7/172f5991efe84bb88de65996324c6e8c [2023-01-28 00:36:26,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:36:26,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:36:26,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:36:26,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:36:26,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:36:26,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a0c3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26, skipping insertion in model container [2023-01-28 00:36:26,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:36:26,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:36:26,574 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:36:26,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:36:26,752 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:36:26,760 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:36:26,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:36:26,833 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:36:26,834 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:36:26,838 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:36:26,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26 WrapperNode [2023-01-28 00:36:26,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:36:26,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:36:26,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:36:26,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:36:26,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,892 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-01-28 00:36:26,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:36:26,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:36:26,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:36:26,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:36:26,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:36:26,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:36:26,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:36:26,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:36:26,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (1/1) ... [2023-01-28 00:36:26,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:36:26,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:36:26,957 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 00:36:26,986 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 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:36:26,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:36:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:36:26,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:36:26,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:36:26,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:36:26,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:36:26,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:36:26,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:36:26,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:36:27,000 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 00:36:27,147 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:36:27,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:36:27,360 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:36:27,481 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:36:27,481 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:36:27,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:36:27 BoogieIcfgContainer [2023-01-28 00:36:27,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:36:27,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:36:27,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:36:27,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:36:27,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:36:26" (1/3) ... [2023-01-28 00:36:27,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1831da6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:36:27, skipping insertion in model container [2023-01-28 00:36:27,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:36:26" (2/3) ... [2023-01-28 00:36:27,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1831da6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:36:27, skipping insertion in model container [2023-01-28 00:36:27,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:36:27" (3/3) ... [2023-01-28 00:36:27,488 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:36:27,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:36:27,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:36:27,501 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:36:27,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:36:27,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2023-01-28 00:36:27,656 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-01-28 00:36:27,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:36:27,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 00:36:27,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2023-01-28 00:36:27,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:27,672 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:36:27,691 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:27,694 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:27,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2023-01-28 00:36:27,724 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-01-28 00:36:27,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:36:27,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 00:36:27,727 INFO L119 LiptonReduction]: Number of co-enabled transitions 2216 [2023-01-28 00:36:30,518 INFO L134 LiptonReduction]: Checked pairs total: 6664 [2023-01-28 00:36:30,518 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-28 00:36:30,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:36:30,549 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;@56108308, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:36:30,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:36:30,552 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 00:36:30,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:36:30,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:30,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:36:30,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:30,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 488433, now seen corresponding path program 1 times [2023-01-28 00:36:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746534055] [2023-01-28 00:36:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:30,845 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 00:36:30,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:30,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746534055] [2023-01-28 00:36:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746534055] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:30,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:36:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685891329] [2023-01-28 00:36:30,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:36:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:36:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:36:30,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 210 [2023-01-28 00:36:30,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 00:36:30,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:30,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 210 [2023-01-28 00:36:30,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:31,201 INFO L130 PetriNetUnfolder]: 1614/2557 cut-off events. [2023-01-28 00:36:31,201 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-01-28 00:36:31,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 2557 events. 1614/2557 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14301 event pairs, 264 based on Foata normal form. 100/2446 useless extension candidates. Maximal degree in co-relation 4964. Up to 1912 conditions per place. [2023-01-28 00:36:31,215 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 35 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-01-28 00:36:31,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2023-01-28 00:36:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:36:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:36:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-01-28 00:36:31,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546031746031746 [2023-01-28 00:36:31,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-01-28 00:36:31,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-01-28 00:36:31,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:31,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-01-28 00:36:31,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 00:36:31,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 00:36:31,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 00:36:31,241 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 344 transitions. [2023-01-28 00:36:31,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2023-01-28 00:36:31,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:36:31,244 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-01-28 00:36:31,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 00:36:31,247 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-01-28 00:36:31,247 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-01-28 00:36:31,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 00:36:31,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:31,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:31,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:36:31,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:31,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash 737093143, now seen corresponding path program 1 times [2023-01-28 00:36:31,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603988936] [2023-01-28 00:36:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:31,513 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 00:36:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:31,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603988936] [2023-01-28 00:36:31,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603988936] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:31,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:31,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:36:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919117489] [2023-01-28 00:36:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:31,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:36:31,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:36:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:36:31,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-01-28 00:36:31,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 00:36:31,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:31,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-01-28 00:36:31,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:31,971 INFO L130 PetriNetUnfolder]: 3621/5394 cut-off events. [2023-01-28 00:36:31,972 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2023-01-28 00:36:31,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 5394 events. 3621/5394 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28024 event pairs, 1145 based on Foata normal form. 282/5676 useless extension candidates. Maximal degree in co-relation 11110. Up to 3183 conditions per place. [2023-01-28 00:36:31,990 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 36 selfloop transitions, 7 changer transitions 29/72 dead transitions. [2023-01-28 00:36:31,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 72 transitions, 306 flow [2023-01-28 00:36:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:36:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:36:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-01-28 00:36:31,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-01-28 00:36:31,993 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-01-28 00:36:31,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-01-28 00:36:31,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:31,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-01-28 00:36:31,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 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 00:36:31,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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 00:36:31,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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 00:36:31,997 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 514 transitions. [2023-01-28 00:36:31,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 72 transitions, 306 flow [2023-01-28 00:36:31,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:31,999 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2023-01-28 00:36:31,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-01-28 00:36:31,999 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-01-28 00:36:32,000 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2023-01-28 00:36:32,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 00:36:32,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:32,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:32,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:36:32,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:32,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:32,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1375055476, now seen corresponding path program 1 times [2023-01-28 00:36:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127207386] [2023-01-28 00:36:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:32,196 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 00:36:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127207386] [2023-01-28 00:36:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127207386] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512233255] [2023-01-28 00:36:32,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:32,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:32,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:32,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:32,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-01-28 00:36:32,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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 00:36:32,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:32,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-01-28 00:36:32,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:32,641 INFO L130 PetriNetUnfolder]: 3115/4686 cut-off events. [2023-01-28 00:36:32,641 INFO L131 PetriNetUnfolder]: For 3442/3442 co-relation queries the response was YES. [2023-01-28 00:36:32,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12834 conditions, 4686 events. 3115/4686 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23488 event pairs, 754 based on Foata normal form. 240/4926 useless extension candidates. Maximal degree in co-relation 12820. Up to 2196 conditions per place. [2023-01-28 00:36:32,661 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 44 selfloop transitions, 8 changer transitions 34/86 dead transitions. [2023-01-28 00:36:32,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 86 transitions, 494 flow [2023-01-28 00:36:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2023-01-28 00:36:32,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748299319727891 [2023-01-28 00:36:32,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2023-01-28 00:36:32,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2023-01-28 00:36:32,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:32,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2023-01-28 00:36:32,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 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 00:36:32,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:32,668 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:32,668 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 7 states and 698 transitions. [2023-01-28 00:36:32,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 86 transitions, 494 flow [2023-01-28 00:36:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 86 transitions, 452 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:32,679 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 178 flow [2023-01-28 00:36:32,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-01-28 00:36:32,680 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-01-28 00:36:32,680 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 178 flow [2023-01-28 00:36:32,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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 00:36:32,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:32,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:32,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:36:32,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:32,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1613845566, now seen corresponding path program 1 times [2023-01-28 00:36:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419242571] [2023-01-28 00:36:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:32,847 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 00:36:32,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419242571] [2023-01-28 00:36:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419242571] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:32,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:32,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:32,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101571053] [2023-01-28 00:36:32,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:32,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:32,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:32,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:32,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:32,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-01-28 00:36:32,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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 00:36:32,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:32,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-01-28 00:36:32,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:33,338 INFO L130 PetriNetUnfolder]: 2902/4382 cut-off events. [2023-01-28 00:36:33,338 INFO L131 PetriNetUnfolder]: For 7028/7028 co-relation queries the response was YES. [2023-01-28 00:36:33,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13130 conditions, 4382 events. 2902/4382 cut-off events. For 7028/7028 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 22274 event pairs, 609 based on Foata normal form. 189/4571 useless extension candidates. Maximal degree in co-relation 13110. Up to 2655 conditions per place. [2023-01-28 00:36:33,360 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 46 selfloop transitions, 15 changer transitions 29/90 dead transitions. [2023-01-28 00:36:33,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 572 flow [2023-01-28 00:36:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2023-01-28 00:36:33,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782312925170068 [2023-01-28 00:36:33,362 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2023-01-28 00:36:33,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2023-01-28 00:36:33,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:33,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2023-01-28 00:36:33,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 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 00:36:33,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:33,365 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:33,365 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 178 flow. Second operand 7 states and 703 transitions. [2023-01-28 00:36:33,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 572 flow [2023-01-28 00:36:33,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 554 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-28 00:36:33,384 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 255 flow [2023-01-28 00:36:33,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-01-28 00:36:33,384 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-01-28 00:36:33,385 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 255 flow [2023-01-28 00:36:33,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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 00:36:33,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:33,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:33,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:36:33,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:33,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:33,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1511985179, now seen corresponding path program 1 times [2023-01-28 00:36:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234032594] [2023-01-28 00:36:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:33,496 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 00:36:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234032594] [2023-01-28 00:36:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234032594] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:33,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:33,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258611383] [2023-01-28 00:36:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:33,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:33,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-01-28 00:36:33,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 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 00:36:33,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:33,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-01-28 00:36:33,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:33,922 INFO L130 PetriNetUnfolder]: 2694/4069 cut-off events. [2023-01-28 00:36:33,923 INFO L131 PetriNetUnfolder]: For 8690/8690 co-relation queries the response was YES. [2023-01-28 00:36:33,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13207 conditions, 4069 events. 2694/4069 cut-off events. For 8690/8690 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20303 event pairs, 498 based on Foata normal form. 172/4241 useless extension candidates. Maximal degree in co-relation 13183. Up to 1957 conditions per place. [2023-01-28 00:36:33,943 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 56 selfloop transitions, 10 changer transitions 30/96 dead transitions. [2023-01-28 00:36:33,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 96 transitions, 705 flow [2023-01-28 00:36:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2023-01-28 00:36:33,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47551020408163264 [2023-01-28 00:36:33,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2023-01-28 00:36:33,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2023-01-28 00:36:33,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:33,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2023-01-28 00:36:33,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 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 00:36:33,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:33,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:33,948 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 255 flow. Second operand 7 states and 699 transitions. [2023-01-28 00:36:33,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 96 transitions, 705 flow [2023-01-28 00:36:33,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 679 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-01-28 00:36:33,969 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 340 flow [2023-01-28 00:36:33,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-01-28 00:36:33,970 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-01-28 00:36:33,970 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 340 flow [2023-01-28 00:36:33,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 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 00:36:33,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:33,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:33,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:36:33,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:33,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash -100345475, now seen corresponding path program 1 times [2023-01-28 00:36:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467145776] [2023-01-28 00:36:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:34,072 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 00:36:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467145776] [2023-01-28 00:36:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467145776] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:34,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:34,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:36:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26389730] [2023-01-28 00:36:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:34,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:36:34,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:36:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:36:34,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-01-28 00:36:34,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:34,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:34,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-01-28 00:36:34,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:34,221 INFO L130 PetriNetUnfolder]: 987/1695 cut-off events. [2023-01-28 00:36:34,222 INFO L131 PetriNetUnfolder]: For 3849/3925 co-relation queries the response was YES. [2023-01-28 00:36:34,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 1695 events. 987/1695 cut-off events. For 3849/3925 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8635 event pairs, 270 based on Foata normal form. 126/1795 useless extension candidates. Maximal degree in co-relation 5438. Up to 1280 conditions per place. [2023-01-28 00:36:34,228 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 47 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-01-28 00:36:34,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 581 flow [2023-01-28 00:36:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:36:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:36:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-01-28 00:36:34,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2023-01-28 00:36:34,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-01-28 00:36:34,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-01-28 00:36:34,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:34,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-01-28 00:36:34,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 00:36:34,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 00:36:34,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 00:36:34,232 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 340 flow. Second operand 3 states and 325 transitions. [2023-01-28 00:36:34,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 581 flow [2023-01-28 00:36:34,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 566 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 00:36:34,237 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 354 flow [2023-01-28 00:36:34,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-01-28 00:36:34,238 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2023-01-28 00:36:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 354 flow [2023-01-28 00:36:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:36:34,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:34,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:34,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:36:34,238 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:34,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -717831266, now seen corresponding path program 1 times [2023-01-28 00:36:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166310981] [2023-01-28 00:36:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:34,425 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 00:36:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:34,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166310981] [2023-01-28 00:36:34,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166310981] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:34,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:34,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807619419] [2023-01-28 00:36:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:34,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:34,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:34,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:34,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-01-28 00:36:34,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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 00:36:34,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:34,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-01-28 00:36:34,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:34,789 INFO L130 PetriNetUnfolder]: 1602/2671 cut-off events. [2023-01-28 00:36:34,789 INFO L131 PetriNetUnfolder]: For 6846/6846 co-relation queries the response was YES. [2023-01-28 00:36:34,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9769 conditions, 2671 events. 1602/2671 cut-off events. For 6846/6846 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14218 event pairs, 134 based on Foata normal form. 75/2746 useless extension candidates. Maximal degree in co-relation 9741. Up to 1096 conditions per place. [2023-01-28 00:36:34,800 INFO L137 encePairwiseOnDemand]: 200/210 looper letters, 65 selfloop transitions, 27 changer transitions 19/111 dead transitions. [2023-01-28 00:36:34,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 919 flow [2023-01-28 00:36:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:36:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:36:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-01-28 00:36:34,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-01-28 00:36:34,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-01-28 00:36:34,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-01-28 00:36:34,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:34,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-01-28 00:36:34,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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 00:36:34,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:34,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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 00:36:34,805 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 354 flow. Second operand 7 states and 686 transitions. [2023-01-28 00:36:34,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 919 flow [2023-01-28 00:36:34,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 111 transitions, 904 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 00:36:34,812 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 584 flow [2023-01-28 00:36:34,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-01-28 00:36:34,813 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2023-01-28 00:36:34,813 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 584 flow [2023-01-28 00:36:34,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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 00:36:34,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:34,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:34,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:36:34,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:34,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:34,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1340676420, now seen corresponding path program 2 times [2023-01-28 00:36:34,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:34,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30993174] [2023-01-28 00:36:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:34,965 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 00:36:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30993174] [2023-01-28 00:36:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30993174] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:36:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60644822] [2023-01-28 00:36:34,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:34,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:36:34,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:34,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:36:34,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:36:34,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-01-28 00:36:34,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 584 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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 00:36:34,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:34,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-01-28 00:36:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:35,105 INFO L130 PetriNetUnfolder]: 562/1071 cut-off events. [2023-01-28 00:36:35,106 INFO L131 PetriNetUnfolder]: For 3047/3102 co-relation queries the response was YES. [2023-01-28 00:36:35,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 1071 events. 562/1071 cut-off events. For 3047/3102 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5517 event pairs, 158 based on Foata normal form. 123/1180 useless extension candidates. Maximal degree in co-relation 4120. Up to 361 conditions per place. [2023-01-28 00:36:35,111 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 71 selfloop transitions, 7 changer transitions 0/98 dead transitions. [2023-01-28 00:36:35,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 1068 flow [2023-01-28 00:36:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:36:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:36:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-01-28 00:36:35,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2023-01-28 00:36:35,112 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-01-28 00:36:35,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-01-28 00:36:35,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:35,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-01-28 00:36:35,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 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 00:36:35,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 00:36:35,114 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 00:36:35,114 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 584 flow. Second operand 4 states and 434 transitions. [2023-01-28 00:36:35,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 1068 flow [2023-01-28 00:36:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 1048 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-01-28 00:36:35,121 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 612 flow [2023-01-28 00:36:35,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=612, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-01-28 00:36:35,123 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-01-28 00:36:35,123 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 612 flow [2023-01-28 00:36:35,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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 00:36:35,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:35,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:35,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:36:35,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:35,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 448296183, now seen corresponding path program 1 times [2023-01-28 00:36:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299127563] [2023-01-28 00:36:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:35,334 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 00:36:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299127563] [2023-01-28 00:36:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299127563] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:35,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:36:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327033023] [2023-01-28 00:36:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:35,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:36:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:35,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:36:35,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:36:35,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-01-28 00:36:35,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 612 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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 00:36:35,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:35,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-01-28 00:36:35,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:35,514 INFO L130 PetriNetUnfolder]: 483/895 cut-off events. [2023-01-28 00:36:35,514 INFO L131 PetriNetUnfolder]: For 2992/3035 co-relation queries the response was YES. [2023-01-28 00:36:35,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3795 conditions, 895 events. 483/895 cut-off events. For 2992/3035 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4498 event pairs, 145 based on Foata normal form. 40/921 useless extension candidates. Maximal degree in co-relation 3761. Up to 361 conditions per place. [2023-01-28 00:36:35,518 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 60 selfloop transitions, 10 changer transitions 8/98 dead transitions. [2023-01-28 00:36:35,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 1076 flow [2023-01-28 00:36:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:36:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:36:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-01-28 00:36:35,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2023-01-28 00:36:35,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-01-28 00:36:35,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-01-28 00:36:35,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:35,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-01-28 00:36:35,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 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 00:36:35,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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 00:36:35,523 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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 00:36:35,523 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 612 flow. Second operand 5 states and 530 transitions. [2023-01-28 00:36:35,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 1076 flow [2023-01-28 00:36:35,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 1029 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-01-28 00:36:35,528 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 586 flow [2023-01-28 00:36:35,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-01-28 00:36:35,528 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-01-28 00:36:35,529 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 586 flow [2023-01-28 00:36:35,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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 00:36:35,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:35,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:35,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:36:35,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:35,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1043453693, now seen corresponding path program 1 times [2023-01-28 00:36:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:35,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545966655] [2023-01-28 00:36:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:35,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:35,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:35,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545966655] [2023-01-28 00:36:35,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545966655] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:35,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:35,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:36:35,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564725123] [2023-01-28 00:36:35,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:35,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:36:35,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:36:35,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:36:35,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-01-28 00:36:35,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 586 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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 00:36:35,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:35,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-01-28 00:36:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:36,169 INFO L130 PetriNetUnfolder]: 622/1191 cut-off events. [2023-01-28 00:36:36,169 INFO L131 PetriNetUnfolder]: For 4693/4770 co-relation queries the response was YES. [2023-01-28 00:36:36,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5007 conditions, 1191 events. 622/1191 cut-off events. For 4693/4770 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6645 event pairs, 75 based on Foata normal form. 13/1193 useless extension candidates. Maximal degree in co-relation 4975. Up to 408 conditions per place. [2023-01-28 00:36:36,175 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 80 selfloop transitions, 6 changer transitions 31/137 dead transitions. [2023-01-28 00:36:36,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1386 flow [2023-01-28 00:36:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:36:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:36:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 794 transitions. [2023-01-28 00:36:36,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726190476190476 [2023-01-28 00:36:36,177 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 794 transitions. [2023-01-28 00:36:36,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 794 transitions. [2023-01-28 00:36:36,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:36,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 794 transitions. [2023-01-28 00:36:36,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 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 00:36:36,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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 00:36:36,180 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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 00:36:36,181 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 586 flow. Second operand 8 states and 794 transitions. [2023-01-28 00:36:36,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1386 flow [2023-01-28 00:36:36,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 137 transitions, 1252 flow, removed 39 selfloop flow, removed 4 redundant places. [2023-01-28 00:36:36,193 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 590 flow [2023-01-28 00:36:36,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-01-28 00:36:36,195 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2023-01-28 00:36:36,195 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 590 flow [2023-01-28 00:36:36,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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 00:36:36,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:36,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:36,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:36:36,196 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:36,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1370556981, now seen corresponding path program 2 times [2023-01-28 00:36:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541938962] [2023-01-28 00:36:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:36:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:36:36,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:36:36,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541938962] [2023-01-28 00:36:36,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541938962] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:36:36,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:36:36,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:36:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270002625] [2023-01-28 00:36:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:36:36,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:36:36,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:36:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:36:36,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:36:36,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-01-28 00:36:36,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 590 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 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 00:36:36,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:36:36,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-01-28 00:36:36,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:36:37,146 INFO L130 PetriNetUnfolder]: 554/1077 cut-off events. [2023-01-28 00:36:37,146 INFO L131 PetriNetUnfolder]: For 4215/4297 co-relation queries the response was YES. [2023-01-28 00:36:37,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 1077 events. 554/1077 cut-off events. For 4215/4297 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6041 event pairs, 62 based on Foata normal form. 36/1106 useless extension candidates. Maximal degree in co-relation 4636. Up to 557 conditions per place. [2023-01-28 00:36:37,151 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 64 selfloop transitions, 6 changer transitions 25/115 dead transitions. [2023-01-28 00:36:37,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 115 transitions, 1135 flow [2023-01-28 00:36:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:36:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:36:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 765 transitions. [2023-01-28 00:36:37,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2023-01-28 00:36:37,153 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 765 transitions. [2023-01-28 00:36:37,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 765 transitions. [2023-01-28 00:36:37,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:36:37,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 765 transitions. [2023-01-28 00:36:37,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.625) internal successors, (765), 8 states have internal predecessors, (765), 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 00:36:37,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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 00:36:37,156 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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 00:36:37,156 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 590 flow. Second operand 8 states and 765 transitions. [2023-01-28 00:36:37,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 115 transitions, 1135 flow [2023-01-28 00:36:37,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 1124 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 00:36:37,165 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 609 flow [2023-01-28 00:36:37,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=609, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-01-28 00:36:37,165 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2023-01-28 00:36:37,166 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 609 flow [2023-01-28 00:36:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 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 00:36:37,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:36:37,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:36:37,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:36:37,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:36:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 118155427, now seen corresponding path program 3 times [2023-01-28 00:36:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:36:37,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622567772] [2023-01-28 00:36:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:36:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:36:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:36:37,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:36:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:36:37,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:36:37,284 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:36:37,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:36:37,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:36:37,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:36:37,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:36:37,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:36:37,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:36:37,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:36:37,287 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:36:37,291 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:36:37,291 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:36:37,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:36:37 BasicIcfg [2023-01-28 00:36:37,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:36:37,350 INFO L158 Benchmark]: Toolchain (without parser) took 10907.15ms. Allocated memory was 358.6MB in the beginning and 964.7MB in the end (delta: 606.1MB). Free memory was 315.5MB in the beginning and 608.1MB in the end (delta: -292.6MB). Peak memory consumption was 316.3MB. Max. memory is 16.0GB. [2023-01-28 00:36:37,350 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 358.6MB. Free memory is still 305.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:36:37,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.44ms. Allocated memory is still 358.6MB. Free memory was 315.2MB in the beginning and 292.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:37,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.78ms. Allocated memory is still 358.6MB. Free memory was 291.7MB in the beginning and 289.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:37,350 INFO L158 Benchmark]: Boogie Preprocessor took 29.82ms. Allocated memory is still 358.6MB. Free memory was 289.6MB in the beginning and 287.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:36:37,350 INFO L158 Benchmark]: RCFGBuilder took 559.49ms. Allocated memory is still 358.6MB. Free memory was 287.5MB in the beginning and 251.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-28 00:36:37,350 INFO L158 Benchmark]: TraceAbstraction took 9864.80ms. Allocated memory was 358.6MB in the beginning and 964.7MB in the end (delta: 606.1MB). Free memory was 251.0MB in the beginning and 608.1MB in the end (delta: -357.1MB). Peak memory consumption was 251.2MB. Max. memory is 16.0GB. [2023-01-28 00:36:37,351 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.44ms. Allocated memory is still 358.6MB. Free memory is still 305.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 395.44ms. Allocated memory is still 358.6MB. Free memory was 315.2MB in the beginning and 292.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.78ms. Allocated memory is still 358.6MB. Free memory was 291.7MB in the beginning and 289.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.82ms. Allocated memory is still 358.6MB. Free memory was 289.6MB in the beginning and 287.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 559.49ms. Allocated memory is still 358.6MB. Free memory was 287.5MB in the beginning and 251.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9864.80ms. Allocated memory was 358.6MB in the beginning and 964.7MB in the end (delta: 606.1MB). Free memory was 251.0MB in the beginning and 608.1MB in the end (delta: -357.1MB). Peak memory consumption was 251.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 119 PlacesBefore, 37 PlacesAfterwards, 111 TransitionsBefore, 28 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 6664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2724, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1187, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2724, independent: 1352, independent conditional: 0, independent unconditional: 1352, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 1187, unknown conditional: 0, unknown unconditional: 1187] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t281, ((void *)0), P0, ((void *)0))=-2, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t282, ((void *)0), P1, ((void *)0))=-1, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t283, ((void *)0), P2, ((void *)0))=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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 7 procedures, 144 locations, 6 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: 9.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1337 IncrementalHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 33 mSDtfsCounter, 1337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=612occurred in iteration=8, InterpolantAutomatonStates: 64, 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.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 00:36:37,389 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...