/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:06:06,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:06:06,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:06:06,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:06:06,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:06:06,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:06:06,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:06:06,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:06:06,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:06:06,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:06:06,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:06:06,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:06:06,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:06:06,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:06:06,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:06:06,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:06:06,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:06:06,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:06:06,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:06:06,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:06:06,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:06:06,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:06:06,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:06:06,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:06:06,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:06:06,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:06:06,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:06:06,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:06:06,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:06:06,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:06:06,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:06:06,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:06:06,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:06:06,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:06:06,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:06:06,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:06:06,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:06:06,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:06:06,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:06:06,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:06:06,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:06:06,112 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-27 18:06:06,141 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:06:06,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:06:06,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:06:06,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:06:06,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:06:06,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:06:06,144 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:06:06,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:06:06,144 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:06:06,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:06:06,145 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:06:06,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:06:06,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:06:06,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:06:06,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:06:06,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:06:06,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:06:06,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:06:06,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:06:06,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:06:06,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:06:06,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:06:06,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:06:06,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:06:06,147 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 [2023-01-27 18:06:06,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:06:06,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:06:06,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:06:06,414 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:06:06,414 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:06:06,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2023-01-27 18:06:07,551 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:06:07,850 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:06:07,851 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2023-01-27 18:06:07,866 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b17f286a/5793a9434474461581a6c249d434abb5/FLAG77af4afd1 [2023-01-27 18:06:07,882 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b17f286a/5793a9434474461581a6c249d434abb5 [2023-01-27 18:06:07,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:06:07,885 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:06:07,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:06:07,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:06:07,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:06:07,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:06:07" (1/1) ... [2023-01-27 18:06:07,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab695cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:07, skipping insertion in model container [2023-01-27 18:06:07,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:06:07" (1/1) ... [2023-01-27 18:06:07,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:06:07,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:06:08,055 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.opt.i[944,957] [2023-01-27 18:06:08,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:06:08,267 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:06:08,278 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.opt.i[944,957] [2023-01-27 18:06:08,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:06:08,369 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:06:08,370 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:06:08,375 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:06:08,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08 WrapperNode [2023-01-27 18:06:08,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:06:08,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:06:08,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:06:08,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:06:08,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,445 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-01-27 18:06:08,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:06:08,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:06:08,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:06:08,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:06:08,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:06:08,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:06:08,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:06:08,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:06:08,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (1/1) ... [2023-01-27 18:06:08,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:06:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:06:08,531 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-27 18:06:08,554 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-27 18:06:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:06:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:06:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:06:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:06:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:06:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:06:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:06:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:06:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:06:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:06:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:06:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:06:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:06:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:06:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:06:08,576 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:06:08,761 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:06:08,764 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:06:09,060 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:06:09,225 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:06:09,241 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:06:09,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:06:09 BoogieIcfgContainer [2023-01-27 18:06:09,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:06:09,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:06:09,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:06:09,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:06:09,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:06:07" (1/3) ... [2023-01-27 18:06:09,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3982c35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:06:09, skipping insertion in model container [2023-01-27 18:06:09,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:08" (2/3) ... [2023-01-27 18:06:09,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3982c35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:06:09, skipping insertion in model container [2023-01-27 18:06:09,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:06:09" (3/3) ... [2023-01-27 18:06:09,250 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2023-01-27 18:06:09,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:06:09,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:06:09,262 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:06:09,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:06:09,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-01-27 18:06:09,388 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-27 18:06:09,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:06:09,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:06:09,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-01-27 18:06:09,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-01-27 18:06:09,400 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:06:09,407 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-27 18:06:09,409 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-27 18:06:09,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-01-27 18:06:09,434 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-27 18:06:09,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:06:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:06:09,437 INFO L119 LiptonReduction]: Number of co-enabled transitions 1962 [2023-01-27 18:06:12,829 INFO L134 LiptonReduction]: Checked pairs total: 5292 [2023-01-27 18:06:12,829 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-27 18:06:12,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:06:12,849 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;@7cc07f13, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:06:12,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:06:12,852 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2023-01-27 18:06:12,853 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:06:12,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:12,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:12,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:12,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:12,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1713803514, now seen corresponding path program 1 times [2023-01-27 18:06:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:12,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357645942] [2023-01-27 18:06:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:13,325 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-27 18:06:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357645942] [2023-01-27 18:06:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357645942] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:13,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:13,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:06:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255914118] [2023-01-27 18:06:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:13,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:06:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:06:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:06:13,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 208 [2023-01-27 18:06:13,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-27 18:06:13,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:13,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 208 [2023-01-27 18:06:13,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:13,687 INFO L130 PetriNetUnfolder]: 1164/1832 cut-off events. [2023-01-27 18:06:13,688 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-01-27 18:06:13,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 1832 events. 1164/1832 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9040 event pairs, 188 based on Foata normal form. 75/1756 useless extension candidates. Maximal degree in co-relation 3590. Up to 1397 conditions per place. [2023-01-27 18:06:13,706 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-01-27 18:06:13,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 149 flow [2023-01-27 18:06:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:06:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:06:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-01-27 18:06:13,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352564102564102 [2023-01-27 18:06:13,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-01-27 18:06:13,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-01-27 18:06:13,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:13,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-01-27 18:06:13,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:13,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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-27 18:06:13,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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-27 18:06:13,748 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 334 transitions. [2023-01-27 18:06:13,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 149 flow [2023-01-27 18:06:13,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:06:13,756 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-01-27 18:06:13,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-27 18:06:13,766 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-27 18:06:13,766 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-01-27 18:06:13,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-27 18:06:13,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:13,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:13,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:06:13,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:13,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1645913665, now seen corresponding path program 1 times [2023-01-27 18:06:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107227077] [2023-01-27 18:06:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:14,141 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-27 18:06:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107227077] [2023-01-27 18:06:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107227077] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:06:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191081487] [2023-01-27 18:06:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:14,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:06:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:06:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:06:14,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:06:14,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 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-27 18:06:14,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:14,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:06:14,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:14,664 INFO L130 PetriNetUnfolder]: 2125/3230 cut-off events. [2023-01-27 18:06:14,665 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2023-01-27 18:06:14,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6690 conditions, 3230 events. 2125/3230 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15950 event pairs, 691 based on Foata normal form. 176/3406 useless extension candidates. Maximal degree in co-relation 6680. Up to 2003 conditions per place. [2023-01-27 18:06:14,684 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 32 selfloop transitions, 7 changer transitions 25/64 dead transitions. [2023-01-27 18:06:14,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 64 transitions, 274 flow [2023-01-27 18:06:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-01-27 18:06:14,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48653846153846153 [2023-01-27 18:06:14,688 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-01-27 18:06:14,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-01-27 18:06:14,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:14,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-01-27 18:06:14,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 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-27 18:06:14,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:14,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:14,695 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 506 transitions. [2023-01-27 18:06:14,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 64 transitions, 274 flow [2023-01-27 18:06:14,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:06:14,700 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 120 flow [2023-01-27 18:06:14,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-01-27 18:06:14,701 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-01-27 18:06:14,702 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 120 flow [2023-01-27 18:06:14,702 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-27 18:06:14,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:14,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:14,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:06:14,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:14,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash -516307342, now seen corresponding path program 1 times [2023-01-27 18:06:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485920572] [2023-01-27 18:06:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:14,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-27 18:06:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485920572] [2023-01-27 18:06:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485920572] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:06:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031775035] [2023-01-27 18:06:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:14,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:14,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:06:14,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 120 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-27 18:06:14,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:14,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:06:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:15,396 INFO L130 PetriNetUnfolder]: 1829/2806 cut-off events. [2023-01-27 18:06:15,397 INFO L131 PetriNetUnfolder]: For 2257/2257 co-relation queries the response was YES. [2023-01-27 18:06:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 2806 events. 1829/2806 cut-off events. For 2257/2257 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13323 event pairs, 451 based on Foata normal form. 144/2950 useless extension candidates. Maximal degree in co-relation 8040. Up to 1395 conditions per place. [2023-01-27 18:06:15,421 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 38 selfloop transitions, 8 changer transitions 28/74 dead transitions. [2023-01-27 18:06:15,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 446 flow [2023-01-27 18:06:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-01-27 18:06:15,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2023-01-27 18:06:15,424 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-01-27 18:06:15,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-01-27 18:06:15,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:15,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-01-27 18:06:15,426 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-27 18:06:15,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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-27 18:06:15,430 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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-27 18:06:15,430 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 120 flow. Second operand 7 states and 686 transitions. [2023-01-27 18:06:15,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 446 flow [2023-01-27 18:06:15,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 404 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:06:15,440 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 174 flow [2023-01-27 18:06:15,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-01-27 18:06:15,441 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-01-27 18:06:15,441 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 174 flow [2023-01-27 18:06:15,441 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-27 18:06:15,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:15,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:15,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:06:15,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:15,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash 21153734, now seen corresponding path program 1 times [2023-01-27 18:06:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067981994] [2023-01-27 18:06:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:15,676 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-27 18:06:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:15,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067981994] [2023-01-27 18:06:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067981994] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:15,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:06:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487548009] [2023-01-27 18:06:15,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:15,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:15,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:15,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:06:15,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 174 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-27 18:06:15,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:15,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:06:15,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:16,113 INFO L130 PetriNetUnfolder]: 1579/2436 cut-off events. [2023-01-27 18:06:16,113 INFO L131 PetriNetUnfolder]: For 3872/3872 co-relation queries the response was YES. [2023-01-27 18:06:16,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7564 conditions, 2436 events. 1579/2436 cut-off events. For 3872/3872 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11591 event pairs, 337 based on Foata normal form. 120/2556 useless extension candidates. Maximal degree in co-relation 7544. Up to 1133 conditions per place. [2023-01-27 18:06:16,129 INFO L137 encePairwiseOnDemand]: 200/208 looper letters, 47 selfloop transitions, 10 changer transitions 26/83 dead transitions. [2023-01-27 18:06:16,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 556 flow [2023-01-27 18:06:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-01-27 18:06:16,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2023-01-27 18:06:16,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-01-27 18:06:16,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-01-27 18:06:16,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:16,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-01-27 18:06:16,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 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-27 18:06:16,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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-27 18:06:16,137 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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-27 18:06:16,137 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 174 flow. Second operand 7 states and 689 transitions. [2023-01-27 18:06:16,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 556 flow [2023-01-27 18:06:16,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 535 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-27 18:06:16,155 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 252 flow [2023-01-27 18:06:16,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-01-27 18:06:16,156 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-27 18:06:16,156 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 252 flow [2023-01-27 18:06:16,156 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-27 18:06:16,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:16,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:16,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:06:16,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:16,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1409532507, now seen corresponding path program 1 times [2023-01-27 18:06:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305101021] [2023-01-27 18:06:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:16,377 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-27 18:06:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305101021] [2023-01-27 18:06:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305101021] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:06:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433316299] [2023-01-27 18:06:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:16,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:06:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:06:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:06:16,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-01-27 18:06:16,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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-27 18:06:16,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:16,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-01-27 18:06:16,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:16,642 INFO L130 PetriNetUnfolder]: 917/1518 cut-off events. [2023-01-27 18:06:16,642 INFO L131 PetriNetUnfolder]: For 3490/3580 co-relation queries the response was YES. [2023-01-27 18:06:16,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 1518 events. 917/1518 cut-off events. For 3490/3580 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7729 event pairs, 169 based on Foata normal form. 175/1658 useless extension candidates. Maximal degree in co-relation 4984. Up to 897 conditions per place. [2023-01-27 18:06:16,652 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 59 selfloop transitions, 7 changer transitions 21/95 dead transitions. [2023-01-27 18:06:16,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 809 flow [2023-01-27 18:06:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-01-27 18:06:16,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019230769230769 [2023-01-27 18:06:16,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-01-27 18:06:16,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-01-27 18:06:16,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:16,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-01-27 18:06:16,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:16,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:16,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:16,658 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 252 flow. Second operand 5 states and 522 transitions. [2023-01-27 18:06:16,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 809 flow [2023-01-27 18:06:16,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 778 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:16,665 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 290 flow [2023-01-27 18:06:16,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-01-27 18:06:16,665 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-27 18:06:16,666 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 290 flow [2023-01-27 18:06:16,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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-27 18:06:16,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:16,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:16,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:06:16,666 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:16,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -330423228, now seen corresponding path program 1 times [2023-01-27 18:06:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179846408] [2023-01-27 18:06:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:16,993 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-27 18:06:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179846408] [2023-01-27 18:06:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179846408] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:16,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:16,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:06:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111505235] [2023-01-27 18:06:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:16,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:16,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:16,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-01-27 18:06:16,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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-27 18:06:16,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:16,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-01-27 18:06:17,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:17,257 INFO L130 PetriNetUnfolder]: 672/1166 cut-off events. [2023-01-27 18:06:17,257 INFO L131 PetriNetUnfolder]: For 2629/2762 co-relation queries the response was YES. [2023-01-27 18:06:17,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4623 conditions, 1166 events. 672/1166 cut-off events. For 2629/2762 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5958 event pairs, 79 based on Foata normal form. 146/1286 useless extension candidates. Maximal degree in co-relation 4597. Up to 404 conditions per place. [2023-01-27 18:06:17,264 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 70 selfloop transitions, 13 changer transitions 34/125 dead transitions. [2023-01-27 18:06:17,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 125 transitions, 1092 flow [2023-01-27 18:06:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2023-01-27 18:06:17,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013736263736264 [2023-01-27 18:06:17,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2023-01-27 18:06:17,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2023-01-27 18:06:17,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:17,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2023-01-27 18:06:17,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 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-27 18:06:17,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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-27 18:06:17,272 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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-27 18:06:17,272 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 290 flow. Second operand 7 states and 730 transitions. [2023-01-27 18:06:17,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 125 transitions, 1092 flow [2023-01-27 18:06:17,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 125 transitions, 1084 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:06:17,280 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 370 flow [2023-01-27 18:06:17,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-01-27 18:06:17,282 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-01-27 18:06:17,283 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 370 flow [2023-01-27 18:06:17,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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-27 18:06:17,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:17,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:17,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:06:17,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:17,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1151052766, now seen corresponding path program 1 times [2023-01-27 18:06:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982422648] [2023-01-27 18:06:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:17,609 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-27 18:06:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982422648] [2023-01-27 18:06:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982422648] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:06:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627832136] [2023-01-27 18:06:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:17,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:06:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:06:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:06:17,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-01-27 18:06:17,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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-27 18:06:17,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:17,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-01-27 18:06:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:17,870 INFO L130 PetriNetUnfolder]: 608/1053 cut-off events. [2023-01-27 18:06:17,870 INFO L131 PetriNetUnfolder]: For 3432/3573 co-relation queries the response was YES. [2023-01-27 18:06:17,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4639 conditions, 1053 events. 608/1053 cut-off events. For 3432/3573 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5357 event pairs, 70 based on Foata normal form. 75/1103 useless extension candidates. Maximal degree in co-relation 4611. Up to 377 conditions per place. [2023-01-27 18:06:17,877 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 66 selfloop transitions, 17 changer transitions 34/125 dead transitions. [2023-01-27 18:06:17,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1146 flow [2023-01-27 18:06:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:06:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:06:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 916 transitions. [2023-01-27 18:06:17,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4893162393162393 [2023-01-27 18:06:17,880 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 916 transitions. [2023-01-27 18:06:17,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 916 transitions. [2023-01-27 18:06:17,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:17,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 916 transitions. [2023-01-27 18:06:17,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.77777777777777) internal successors, (916), 9 states have internal predecessors, (916), 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-27 18:06:17,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 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-27 18:06:17,886 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 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-27 18:06:17,886 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 370 flow. Second operand 9 states and 916 transitions. [2023-01-27 18:06:17,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1146 flow [2023-01-27 18:06:17,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 125 transitions, 1076 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:17,900 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 382 flow [2023-01-27 18:06:17,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=382, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-01-27 18:06:17,901 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2023-01-27 18:06:17,901 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 382 flow [2023-01-27 18:06:17,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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-27 18:06:17,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:17,902 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] [2023-01-27 18:06:17,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:06:17,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:17,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash -191668671, now seen corresponding path program 1 times [2023-01-27 18:06:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827203955] [2023-01-27 18:06:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:18,163 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-27 18:06:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827203955] [2023-01-27 18:06:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827203955] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:06:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313217200] [2023-01-27 18:06:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:18,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:18,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-01-27 18:06:18,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 382 flow. Second operand has 5 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 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-27 18:06:18,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:18,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-01-27 18:06:18,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:18,450 INFO L130 PetriNetUnfolder]: 795/1451 cut-off events. [2023-01-27 18:06:18,451 INFO L131 PetriNetUnfolder]: For 5712/5747 co-relation queries the response was YES. [2023-01-27 18:06:18,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6530 conditions, 1451 events. 795/1451 cut-off events. For 5712/5747 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8146 event pairs, 160 based on Foata normal form. 12/1450 useless extension candidates. Maximal degree in co-relation 6500. Up to 827 conditions per place. [2023-01-27 18:06:18,457 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 35 selfloop transitions, 1 changer transitions 59/97 dead transitions. [2023-01-27 18:06:18,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 932 flow [2023-01-27 18:06:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-27 18:06:18,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913461538461538 [2023-01-27 18:06:18,459 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-27 18:06:18,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-27 18:06:18,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:18,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-27 18:06:18,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:18,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:18,463 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:18,463 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 382 flow. Second operand 5 states and 511 transitions. [2023-01-27 18:06:18,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 932 flow [2023-01-27 18:06:18,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 773 flow, removed 43 selfloop flow, removed 9 redundant places. [2023-01-27 18:06:18,482 INFO L231 Difference]: Finished difference. Result has 61 places, 34 transitions, 203 flow [2023-01-27 18:06:18,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=61, PETRI_TRANSITIONS=34} [2023-01-27 18:06:18,483 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2023-01-27 18:06:18,483 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 34 transitions, 203 flow [2023-01-27 18:06:18,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 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-27 18:06:18,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:18,484 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] [2023-01-27 18:06:18,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:06:18,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:18,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 589131765, now seen corresponding path program 2 times [2023-01-27 18:06:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:18,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967645830] [2023-01-27 18:06:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:18,732 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-27 18:06:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967645830] [2023-01-27 18:06:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967645830] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:06:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509188001] [2023-01-27 18:06:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:18,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:06:18,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 34 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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-27 18:06:18,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:18,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:06:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:18,840 INFO L130 PetriNetUnfolder]: 184/374 cut-off events. [2023-01-27 18:06:18,840 INFO L131 PetriNetUnfolder]: For 733/733 co-relation queries the response was YES. [2023-01-27 18:06:18,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 374 events. 184/374 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1462 event pairs, 56 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1402. Up to 228 conditions per place. [2023-01-27 18:06:18,846 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 29 selfloop transitions, 4 changer transitions 19/52 dead transitions. [2023-01-27 18:06:18,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 398 flow [2023-01-27 18:06:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-01-27 18:06:18,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46057692307692305 [2023-01-27 18:06:18,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-01-27 18:06:18,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-01-27 18:06:18,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:18,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-01-27 18:06:18,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 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-27 18:06:18,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:18,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-27 18:06:18,853 INFO L175 Difference]: Start difference. First operand has 61 places, 34 transitions, 203 flow. Second operand 5 states and 479 transitions. [2023-01-27 18:06:18,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 398 flow [2023-01-27 18:06:18,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 362 flow, removed 12 selfloop flow, removed 9 redundant places. [2023-01-27 18:06:18,856 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 148 flow [2023-01-27 18:06:18,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2023-01-27 18:06:18,857 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-27 18:06:18,857 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 148 flow [2023-01-27 18:06:18,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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-27 18:06:18,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:18,858 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] [2023-01-27 18:06:18,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:06:18,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:06:18,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 246199613, now seen corresponding path program 3 times [2023-01-27 18:06:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513018591] [2023-01-27 18:06:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:06:18,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:06:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:06:18,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:06:18,989 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:06:18,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:06:18,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:06:18,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:06:18,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:06:18,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:06:18,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:06:18,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:06:18,992 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:18,997 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:06:18,997 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:06:19,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:06:19 BasicIcfg [2023-01-27 18:06:19,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:06:19,077 INFO L158 Benchmark]: Toolchain (without parser) took 11192.09ms. Allocated memory was 367.0MB in the beginning and 528.5MB in the end (delta: 161.5MB). Free memory was 325.1MB in the beginning and 287.4MB in the end (delta: 37.8MB). Peak memory consumption was 200.5MB. Max. memory is 16.0GB. [2023-01-27 18:06:19,077 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:06:19,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.30ms. Allocated memory is still 367.0MB. Free memory was 325.1MB in the beginning and 301.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:06:19,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.32ms. Allocated memory is still 367.0MB. Free memory was 301.4MB in the beginning and 298.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:06:19,078 INFO L158 Benchmark]: Boogie Preprocessor took 51.95ms. Allocated memory is still 367.0MB. Free memory was 298.4MB in the beginning and 296.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:06:19,078 INFO L158 Benchmark]: RCFGBuilder took 744.29ms. Allocated memory is still 367.0MB. Free memory was 296.7MB in the beginning and 331.4MB in the end (delta: -34.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.0GB. [2023-01-27 18:06:19,078 INFO L158 Benchmark]: TraceAbstraction took 9831.92ms. Allocated memory was 367.0MB in the beginning and 528.5MB in the end (delta: 161.5MB). Free memory was 330.5MB in the beginning and 287.4MB in the end (delta: 43.2MB). Peak memory consumption was 204.3MB. Max. memory is 16.0GB. [2023-01-27 18:06:19,080 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.13ms. Allocated memory is still 255.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 490.30ms. Allocated memory is still 367.0MB. Free memory was 325.1MB in the beginning and 301.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.32ms. Allocated memory is still 367.0MB. Free memory was 301.4MB in the beginning and 298.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.95ms. Allocated memory is still 367.0MB. Free memory was 298.4MB in the beginning and 296.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 744.29ms. Allocated memory is still 367.0MB. Free memory was 296.7MB in the beginning and 331.4MB in the end (delta: -34.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.0GB. * TraceAbstraction took 9831.92ms. Allocated memory was 367.0MB in the beginning and 528.5MB in the end (delta: 161.5MB). Free memory was 330.5MB in the beginning and 287.4MB in the end (delta: 43.2MB). Peak memory consumption was 204.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 117 PlacesBefore, 35 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 5292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2432, independent: 2244, independent conditional: 0, independent unconditional: 2244, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1071, independent: 1039, independent conditional: 0, independent unconditional: 1039, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2432, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1071, unknown conditional: 0, unknown unconditional: 1071] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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 main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((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=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=-2, t284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=-1, t284={5:0}, t285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L815] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L816] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L817] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L818] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L820] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L871] 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=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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 852]: 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: 854]: 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: 856]: 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, 140 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: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 19 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=7, InterpolantAutomatonStates: 53, 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, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-27 18:06:19,100 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...