/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:50:54,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:50:54,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:50:54,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:50:54,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:50:54,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:50:54,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:50:54,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:50:54,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:50:54,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:50:54,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:50:54,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:50:54,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:50:54,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:50:54,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:50:54,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:50:54,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:50:54,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:50:54,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:50:54,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:50:54,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:50:54,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:50:54,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:50:54,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:50:54,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:50:54,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:50:54,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:50:54,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:50:54,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:50:54,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:50:54,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:50:54,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:50:54,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:50:54,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:50:54,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:50:54,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:50:54,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:50:54,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:50:54,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:50:54,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:50:54,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:50:54,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:50:54,443 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:50:54,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:50:54,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:50:54,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:50:54,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:50:54,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:50:54,445 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:50:54,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:50:54,446 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:50:54,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:50:54,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:50:54,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:50:54,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:50:54,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:50:54,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:50:54,447 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:50:54,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:50:54,447 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:50:54,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:50:54,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:50:54,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:50:54,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:50:54,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:50:54,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:50:54,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:50:54,449 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:50:54,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:50:54,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:50:54,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:50:54,685 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:50:54,686 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:50:54,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2023-01-28 06:50:55,897 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:50:56,114 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:50:56,114 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2023-01-28 06:50:56,126 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cdacf54f/bfff5b3bdb14465ea140940690548875/FLAG6f072db02 [2023-01-28 06:50:56,137 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cdacf54f/bfff5b3bdb14465ea140940690548875 [2023-01-28 06:50:56,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:50:56,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:50:56,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:50:56,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:50:56,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:50:56,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e30c9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56, skipping insertion in model container [2023-01-28 06:50:56,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:50:56,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:50:56,300 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/mix018.opt.i[944,957] [2023-01-28 06:50:56,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:50:56,501 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:50:56,513 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/mix018.opt.i[944,957] [2023-01-28 06:50:56,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:50:56,614 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:50:56,614 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:50:56,619 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:50:56,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56 WrapperNode [2023-01-28 06:50:56,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:50:56,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:50:56,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:50:56,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:50:56,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,695 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-01-28 06:50:56,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:50:56,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:50:56,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:50:56,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:50:56,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,748 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:50:56,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:50:56,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:50:56,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:50:56,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (1/1) ... [2023-01-28 06:50:56,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:50:56,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:50:56,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:50:56,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:50:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:50:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:50:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:50:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:50:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:50:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:50:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:50:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:50:56,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:50:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:50:56,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:50:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:50:56,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:50:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:50:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:50:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:50:56,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:50:56,853 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:50:57,021 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:50:57,022 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:50:57,367 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:50:57,467 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:50:57,467 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:50:57,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:50:57 BoogieIcfgContainer [2023-01-28 06:50:57,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:50:57,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:50:57,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:50:57,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:50:57,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:50:56" (1/3) ... [2023-01-28 06:50:57,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdf3dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:50:57, skipping insertion in model container [2023-01-28 06:50:57,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:56" (2/3) ... [2023-01-28 06:50:57,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdf3dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:50:57, skipping insertion in model container [2023-01-28 06:50:57,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:50:57" (3/3) ... [2023-01-28 06:50:57,476 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2023-01-28 06:50:57,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:50:57,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:50:57,491 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:50:57,557 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:50:57,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-01-28 06:50:57,637 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-28 06:50:57,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:57,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-28 06:50:57,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-01-28 06:50:57,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-01-28 06:50:57,649 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:50:57,656 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-28 06:50:57,658 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-28 06:50:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-01-28 06:50:57,686 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-28 06:50:57,687 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:57,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-28 06:50:57,689 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-01-28 06:51:01,378 INFO L134 LiptonReduction]: Checked pairs total: 6842 [2023-01-28 06:51:01,378 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-01-28 06:51:01,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:51:01,396 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;@7115d106, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:51:01,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:51:01,403 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-28 06:51:01,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:51:01,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:01,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:01,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:01,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash 225750539, now seen corresponding path program 1 times [2023-01-28 06:51:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936233230] [2023-01-28 06:51:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:01,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936233230] [2023-01-28 06:51:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936233230] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:01,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:51:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194725327] [2023-01-28 06:51:01,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:01,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:51:01,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:51:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:51:01,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-01-28 06:51:01,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:01,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:01,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-01-28 06:51:01,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:02,442 INFO L130 PetriNetUnfolder]: 3113/4511 cut-off events. [2023-01-28 06:51:02,443 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 06:51:02,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4511 events. 3113/4511 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24008 event pairs, 593 based on Foata normal form. 0/4327 useless extension candidates. Maximal degree in co-relation 8893. Up to 3385 conditions per place. [2023-01-28 06:51:02,474 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-01-28 06:51:02,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2023-01-28 06:51:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:51:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:51:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-01-28 06:51:02,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404255319148936 [2023-01-28 06:51:02,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-01-28 06:51:02,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-01-28 06:51:02,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:02,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-01-28 06:51:02,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:02,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:02,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:02,506 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 381 transitions. [2023-01-28 06:51:02,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2023-01-28 06:51:02,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:51:02,513 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-01-28 06:51:02,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-01-28 06:51:02,520 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-01-28 06:51:02,521 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-01-28 06:51:02,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:02,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:02,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:02,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:51:02,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:02,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -582167020, now seen corresponding path program 1 times [2023-01-28 06:51:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833354698] [2023-01-28 06:51:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833354698] [2023-01-28 06:51:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833354698] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:02,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:02,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:51:02,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912363787] [2023-01-28 06:51:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:02,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:51:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:51:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:51:02,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-01-28 06:51:02,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:02,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:02,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-01-28 06:51:02,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:04,122 INFO L130 PetriNetUnfolder]: 9425/13038 cut-off events. [2023-01-28 06:51:04,122 INFO L131 PetriNetUnfolder]: For 500/500 co-relation queries the response was YES. [2023-01-28 06:51:04,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26854 conditions, 13038 events. 9425/13038 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 66800 event pairs, 3245 based on Foata normal form. 568/13606 useless extension candidates. Maximal degree in co-relation 26844. Up to 8141 conditions per place. [2023-01-28 06:51:04,190 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 40 selfloop transitions, 7 changer transitions 29/76 dead transitions. [2023-01-28 06:51:04,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2023-01-28 06:51:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:51:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:51:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-01-28 06:51:04,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046808510638298 [2023-01-28 06:51:04,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-01-28 06:51:04,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-01-28 06:51:04,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:04,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-01-28 06:51:04,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:04,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:04,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:04,199 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 593 transitions. [2023-01-28 06:51:04,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2023-01-28 06:51:04,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:04,208 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 130 flow [2023-01-28 06:51:04,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-01-28 06:51:04,208 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-01-28 06:51:04,209 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 130 flow [2023-01-28 06:51:04,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:04,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:04,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:04,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:51:04,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:04,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -867327477, now seen corresponding path program 1 times [2023-01-28 06:51:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003399031] [2023-01-28 06:51:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003399031] [2023-01-28 06:51:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003399031] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:51:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218175187] [2023-01-28 06:51:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:04,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:51:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:51:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:51:04,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-01-28 06:51:04,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:04,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:04,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-01-28 06:51:04,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:05,246 INFO L130 PetriNetUnfolder]: 6051/8856 cut-off events. [2023-01-28 06:51:05,246 INFO L131 PetriNetUnfolder]: For 6283/6549 co-relation queries the response was YES. [2023-01-28 06:51:05,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23660 conditions, 8856 events. 6051/8856 cut-off events. For 6283/6549 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 49947 event pairs, 2041 based on Foata normal form. 484/9142 useless extension candidates. Maximal degree in co-relation 23646. Up to 4995 conditions per place. [2023-01-28 06:51:05,313 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 34 selfloop transitions, 3 changer transitions 24/67 dead transitions. [2023-01-28 06:51:05,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 380 flow [2023-01-28 06:51:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:51:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:51:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-01-28 06:51:05,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174468085106383 [2023-01-28 06:51:05,316 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-01-28 06:51:05,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-01-28 06:51:05,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:05,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-01-28 06:51:05,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:05,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:05,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:05,321 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 130 flow. Second operand 5 states and 608 transitions. [2023-01-28 06:51:05,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 380 flow [2023-01-28 06:51:05,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:05,347 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 129 flow [2023-01-28 06:51:05,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-01-28 06:51:05,348 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-01-28 06:51:05,351 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 129 flow [2023-01-28 06:51:05,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:05,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:05,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:51:05,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:05,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1455448843, now seen corresponding path program 1 times [2023-01-28 06:51:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719696962] [2023-01-28 06:51:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:05,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719696962] [2023-01-28 06:51:05,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719696962] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:05,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:05,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:51:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346602738] [2023-01-28 06:51:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:05,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:51:05,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:51:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:51:05,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-01-28 06:51:05,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:05,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:05,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-01-28 06:51:05,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:06,550 INFO L130 PetriNetUnfolder]: 7483/10444 cut-off events. [2023-01-28 06:51:06,551 INFO L131 PetriNetUnfolder]: For 7554/7554 co-relation queries the response was YES. [2023-01-28 06:51:06,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28491 conditions, 10444 events. 7483/10444 cut-off events. For 7554/7554 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 52511 event pairs, 1905 based on Foata normal form. 380/10824 useless extension candidates. Maximal degree in co-relation 28474. Up to 6417 conditions per place. [2023-01-28 06:51:06,609 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 57 selfloop transitions, 11 changer transitions 32/100 dead transitions. [2023-01-28 06:51:06,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 555 flow [2023-01-28 06:51:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2023-01-28 06:51:06,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2023-01-28 06:51:06,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2023-01-28 06:51:06,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2023-01-28 06:51:06,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:06,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2023-01-28 06:51:06,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:06,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:06,623 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:06,623 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 129 flow. Second operand 7 states and 820 transitions. [2023-01-28 06:51:06,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 555 flow [2023-01-28 06:51:06,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 100 transitions, 535 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 06:51:06,649 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 193 flow [2023-01-28 06:51:06,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=117, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-01-28 06:51:06,650 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-01-28 06:51:06,651 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 193 flow [2023-01-28 06:51:06,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:06,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:06,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:06,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:51:06,651 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:06,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2125053244, now seen corresponding path program 1 times [2023-01-28 06:51:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80353548] [2023-01-28 06:51:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:06,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:06,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80353548] [2023-01-28 06:51:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80353548] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:06,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:06,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:51:06,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147954921] [2023-01-28 06:51:06,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:06,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:51:06,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:51:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:51:06,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 06:51:06,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:06,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:06,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 06:51:06,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:07,505 INFO L130 PetriNetUnfolder]: 4552/6701 cut-off events. [2023-01-28 06:51:07,505 INFO L131 PetriNetUnfolder]: For 8442/9001 co-relation queries the response was YES. [2023-01-28 06:51:07,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19849 conditions, 6701 events. 4552/6701 cut-off events. For 8442/9001 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 37814 event pairs, 972 based on Foata normal form. 606/7028 useless extension candidates. Maximal degree in co-relation 19830. Up to 4572 conditions per place. [2023-01-28 06:51:07,542 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-01-28 06:51:07,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 615 flow [2023-01-28 06:51:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:51:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:51:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-01-28 06:51:07,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-01-28 06:51:07,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-01-28 06:51:07,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-01-28 06:51:07,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:07,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-01-28 06:51:07,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:07,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:07,548 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:07,548 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 193 flow. Second operand 5 states and 600 transitions. [2023-01-28 06:51:07,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 615 flow [2023-01-28 06:51:07,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 601 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:07,580 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 260 flow [2023-01-28 06:51:07,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-01-28 06:51:07,582 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-01-28 06:51:07,582 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 260 flow [2023-01-28 06:51:07,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:07,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:07,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:07,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:51:07,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:07,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 12403944, now seen corresponding path program 1 times [2023-01-28 06:51:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:07,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270644976] [2023-01-28 06:51:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:07,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:07,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270644976] [2023-01-28 06:51:07,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270644976] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:07,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:07,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:51:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017503439] [2023-01-28 06:51:07,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:07,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:51:07,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:07,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:51:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:51:07,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-01-28 06:51:07,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:07,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:07,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-01-28 06:51:07,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:08,695 INFO L130 PetriNetUnfolder]: 7375/10738 cut-off events. [2023-01-28 06:51:08,695 INFO L131 PetriNetUnfolder]: For 15538/15538 co-relation queries the response was YES. [2023-01-28 06:51:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39804 conditions, 10738 events. 7375/10738 cut-off events. For 15538/15538 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 58974 event pairs, 2079 based on Foata normal form. 170/10908 useless extension candidates. Maximal degree in co-relation 39782. Up to 5160 conditions per place. [2023-01-28 06:51:08,744 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 62 selfloop transitions, 9 changer transitions 32/103 dead transitions. [2023-01-28 06:51:08,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 103 transitions, 735 flow [2023-01-28 06:51:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:51:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:51:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-01-28 06:51:08,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957446808510638 [2023-01-28 06:51:08,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-01-28 06:51:08,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-01-28 06:51:08,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:08,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-01-28 06:51:08,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:08,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:08,751 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:08,751 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 260 flow. Second operand 6 states and 699 transitions. [2023-01-28 06:51:08,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 103 transitions, 735 flow [2023-01-28 06:51:08,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 103 transitions, 724 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:08,784 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 252 flow [2023-01-28 06:51:08,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-01-28 06:51:08,784 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-01-28 06:51:08,784 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 252 flow [2023-01-28 06:51:08,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:08,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:08,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:08,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:51:08,785 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:08,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 993608901, now seen corresponding path program 1 times [2023-01-28 06:51:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504417856] [2023-01-28 06:51:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:08,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:08,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504417856] [2023-01-28 06:51:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504417856] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:08,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:08,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:51:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118266523] [2023-01-28 06:51:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:08,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:51:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:51:08,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:51:08,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 06:51:08,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:08,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:08,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 06:51:08,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:09,589 INFO L130 PetriNetUnfolder]: 3014/4757 cut-off events. [2023-01-28 06:51:09,589 INFO L131 PetriNetUnfolder]: For 7379/7677 co-relation queries the response was YES. [2023-01-28 06:51:09,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17500 conditions, 4757 events. 3014/4757 cut-off events. For 7379/7677 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 28045 event pairs, 391 based on Foata normal form. 484/5085 useless extension candidates. Maximal degree in co-relation 17475. Up to 2106 conditions per place. [2023-01-28 06:51:09,619 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 86 selfloop transitions, 13 changer transitions 2/108 dead transitions. [2023-01-28 06:51:09,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 824 flow [2023-01-28 06:51:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:51:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:51:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 722 transitions. [2023-01-28 06:51:09,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120567375886524 [2023-01-28 06:51:09,622 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 722 transitions. [2023-01-28 06:51:09,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 722 transitions. [2023-01-28 06:51:09,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:09,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 722 transitions. [2023-01-28 06:51:09,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:09,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:09,628 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:09,628 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 252 flow. Second operand 6 states and 722 transitions. [2023-01-28 06:51:09,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 824 flow [2023-01-28 06:51:09,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 108 transitions, 759 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-01-28 06:51:09,653 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 329 flow [2023-01-28 06:51:09,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-01-28 06:51:09,654 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-01-28 06:51:09,655 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 329 flow [2023-01-28 06:51:09,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:09,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:09,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:09,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:51:09,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:09,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash 498050930, now seen corresponding path program 1 times [2023-01-28 06:51:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130924023] [2023-01-28 06:51:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130924023] [2023-01-28 06:51:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130924023] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:51:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004250157] [2023-01-28 06:51:09,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:09,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:51:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:51:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:51:09,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 06:51:09,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:09,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:09,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 06:51:09,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:10,518 INFO L130 PetriNetUnfolder]: 2451/3953 cut-off events. [2023-01-28 06:51:10,518 INFO L131 PetriNetUnfolder]: For 7652/7976 co-relation queries the response was YES. [2023-01-28 06:51:10,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16904 conditions, 3953 events. 2451/3953 cut-off events. For 7652/7976 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 23665 event pairs, 226 based on Foata normal form. 305/4117 useless extension candidates. Maximal degree in co-relation 16879. Up to 1751 conditions per place. [2023-01-28 06:51:10,533 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 95 selfloop transitions, 21 changer transitions 15/138 dead transitions. [2023-01-28 06:51:10,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 138 transitions, 1083 flow [2023-01-28 06:51:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:51:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:51:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-01-28 06:51:10,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-01-28 06:51:10,537 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-01-28 06:51:10,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-01-28 06:51:10,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:10,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-01-28 06:51:10,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:10,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:10,542 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:10,542 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 329 flow. Second operand 8 states and 960 transitions. [2023-01-28 06:51:10,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 138 transitions, 1083 flow [2023-01-28 06:51:10,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 138 transitions, 1032 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-28 06:51:10,636 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 435 flow [2023-01-28 06:51:10,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=435, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2023-01-28 06:51:10,637 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-01-28 06:51:10,637 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 435 flow [2023-01-28 06:51:10,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:10,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:10,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:10,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:51:10,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:10,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 657305743, now seen corresponding path program 1 times [2023-01-28 06:51:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455665574] [2023-01-28 06:51:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455665574] [2023-01-28 06:51:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455665574] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:10,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:51:10,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54809825] [2023-01-28 06:51:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:51:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:10,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:51:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:51:10,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-01-28 06:51:10,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:10,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:10,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-01-28 06:51:10,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:11,539 INFO L130 PetriNetUnfolder]: 4125/6543 cut-off events. [2023-01-28 06:51:11,539 INFO L131 PetriNetUnfolder]: For 20839/20839 co-relation queries the response was YES. [2023-01-28 06:51:11,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28142 conditions, 6543 events. 4125/6543 cut-off events. For 20839/20839 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 39104 event pairs, 232 based on Foata normal form. 16/6559 useless extension candidates. Maximal degree in co-relation 28115. Up to 3199 conditions per place. [2023-01-28 06:51:11,574 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 93 selfloop transitions, 22 changer transitions 54/169 dead transitions. [2023-01-28 06:51:11,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 169 transitions, 1669 flow [2023-01-28 06:51:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-01-28 06:51:11,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869300911854103 [2023-01-28 06:51:11,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-01-28 06:51:11,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-01-28 06:51:11,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:11,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-01-28 06:51:11,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:11,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:11,582 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:11,582 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 435 flow. Second operand 7 states and 801 transitions. [2023-01-28 06:51:11,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 169 transitions, 1669 flow [2023-01-28 06:51:11,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 169 transitions, 1364 flow, removed 122 selfloop flow, removed 4 redundant places. [2023-01-28 06:51:11,886 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 445 flow [2023-01-28 06:51:11,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-01-28 06:51:11,886 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-01-28 06:51:11,886 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 445 flow [2023-01-28 06:51:11,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:11,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:11,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:11,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:51:11,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:11,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:11,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1133163897, now seen corresponding path program 2 times [2023-01-28 06:51:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549266742] [2023-01-28 06:51:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:12,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549266742] [2023-01-28 06:51:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549266742] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:51:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841991695] [2023-01-28 06:51:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:12,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:51:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:51:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:51:12,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 06:51:12,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:12,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:12,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 06:51:12,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:12,561 INFO L130 PetriNetUnfolder]: 1596/2587 cut-off events. [2023-01-28 06:51:12,561 INFO L131 PetriNetUnfolder]: For 7458/7931 co-relation queries the response was YES. [2023-01-28 06:51:12,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 2587 events. 1596/2587 cut-off events. For 7458/7931 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14542 event pairs, 168 based on Foata normal form. 220/2738 useless extension candidates. Maximal degree in co-relation 10871. Up to 923 conditions per place. [2023-01-28 06:51:12,573 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 75 selfloop transitions, 18 changer transitions 29/131 dead transitions. [2023-01-28 06:51:12,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 1191 flow [2023-01-28 06:51:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:51:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:51:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 938 transitions. [2023-01-28 06:51:12,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498936170212766 [2023-01-28 06:51:12,577 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 938 transitions. [2023-01-28 06:51:12,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 938 transitions. [2023-01-28 06:51:12,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:12,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 938 transitions. [2023-01-28 06:51:12,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:12,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:12,582 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:12,582 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 445 flow. Second operand 8 states and 938 transitions. [2023-01-28 06:51:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 1191 flow [2023-01-28 06:51:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 131 transitions, 1103 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-01-28 06:51:12,629 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 424 flow [2023-01-28 06:51:12,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-01-28 06:51:12,629 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2023-01-28 06:51:12,630 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 424 flow [2023-01-28 06:51:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:12,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:12,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:12,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:51:12,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:12,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1883579643, now seen corresponding path program 1 times [2023-01-28 06:51:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707465516] [2023-01-28 06:51:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:13,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707465516] [2023-01-28 06:51:13,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707465516] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:13,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:13,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:51:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114402394] [2023-01-28 06:51:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:13,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:51:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:51:13,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:51:13,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 06:51:13,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:13,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:13,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 06:51:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:13,588 INFO L130 PetriNetUnfolder]: 1130/1813 cut-off events. [2023-01-28 06:51:13,588 INFO L131 PetriNetUnfolder]: For 6065/6065 co-relation queries the response was YES. [2023-01-28 06:51:13,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8502 conditions, 1813 events. 1130/1813 cut-off events. For 6065/6065 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8219 event pairs, 43 based on Foata normal form. 1/1814 useless extension candidates. Maximal degree in co-relation 8472. Up to 782 conditions per place. [2023-01-28 06:51:13,594 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 89 selfloop transitions, 33 changer transitions 56/178 dead transitions. [2023-01-28 06:51:13,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 178 transitions, 1689 flow [2023-01-28 06:51:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 06:51:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 06:51:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1257 transitions. [2023-01-28 06:51:13,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44574468085106383 [2023-01-28 06:51:13,600 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1257 transitions. [2023-01-28 06:51:13,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1257 transitions. [2023-01-28 06:51:13,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:13,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1257 transitions. [2023-01-28 06:51:13,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:13,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 235.0) internal successors, (3055), 13 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:13,607 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 235.0) internal successors, (3055), 13 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:13,608 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 424 flow. Second operand 12 states and 1257 transitions. [2023-01-28 06:51:13,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 178 transitions, 1689 flow [2023-01-28 06:51:13,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 178 transitions, 1391 flow, removed 66 selfloop flow, removed 11 redundant places. [2023-01-28 06:51:13,627 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 596 flow [2023-01-28 06:51:13,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=596, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2023-01-28 06:51:13,628 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-01-28 06:51:13,628 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 596 flow [2023-01-28 06:51:13,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:13,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:13,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:13,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:51:13,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:13,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1118700259, now seen corresponding path program 2 times [2023-01-28 06:51:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688305823] [2023-01-28 06:51:13,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:13,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:13,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688305823] [2023-01-28 06:51:13,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688305823] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:13,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:51:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290283398] [2023-01-28 06:51:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:13,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:51:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:51:13,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:51:13,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-01-28 06:51:13,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:13,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:13,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-01-28 06:51:13,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:14,187 INFO L130 PetriNetUnfolder]: 1174/1908 cut-off events. [2023-01-28 06:51:14,187 INFO L131 PetriNetUnfolder]: For 5861/5861 co-relation queries the response was YES. [2023-01-28 06:51:14,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8356 conditions, 1908 events. 1174/1908 cut-off events. For 5861/5861 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9096 event pairs, 206 based on Foata normal form. 1/1909 useless extension candidates. Maximal degree in co-relation 8335. Up to 990 conditions per place. [2023-01-28 06:51:14,195 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 45 selfloop transitions, 8 changer transitions 81/134 dead transitions. [2023-01-28 06:51:14,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 134 transitions, 1202 flow [2023-01-28 06:51:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2023-01-28 06:51:14,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2023-01-28 06:51:14,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 777 transitions. [2023-01-28 06:51:14,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 777 transitions. [2023-01-28 06:51:14,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:14,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 777 transitions. [2023-01-28 06:51:14,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,203 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,203 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 596 flow. Second operand 7 states and 777 transitions. [2023-01-28 06:51:14,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 134 transitions, 1202 flow [2023-01-28 06:51:14,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 134 transitions, 1191 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 06:51:14,227 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 300 flow [2023-01-28 06:51:14,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-01-28 06:51:14,227 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-01-28 06:51:14,228 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 300 flow [2023-01-28 06:51:14,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:14,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:14,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:51:14,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:14,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 370874973, now seen corresponding path program 3 times [2023-01-28 06:51:14,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:14,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128399480] [2023-01-28 06:51:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:14,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128399480] [2023-01-28 06:51:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128399480] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:51:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346991532] [2023-01-28 06:51:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:51:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:51:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:51:14,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-01-28 06:51:14,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:14,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-01-28 06:51:14,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:14,665 INFO L130 PetriNetUnfolder]: 321/583 cut-off events. [2023-01-28 06:51:14,665 INFO L131 PetriNetUnfolder]: For 1941/1941 co-relation queries the response was YES. [2023-01-28 06:51:14,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 583 events. 321/583 cut-off events. For 1941/1941 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2503 event pairs, 39 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 2538. Up to 248 conditions per place. [2023-01-28 06:51:14,667 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 48 selfloop transitions, 5 changer transitions 41/94 dead transitions. [2023-01-28 06:51:14,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 761 flow [2023-01-28 06:51:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-01-28 06:51:14,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644376899696049 [2023-01-28 06:51:14,670 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-01-28 06:51:14,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-01-28 06:51:14,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:14,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-01-28 06:51:14,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,675 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,675 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 300 flow. Second operand 7 states and 764 transitions. [2023-01-28 06:51:14,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 761 flow [2023-01-28 06:51:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 695 flow, removed 7 selfloop flow, removed 15 redundant places. [2023-01-28 06:51:14,681 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 207 flow [2023-01-28 06:51:14,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-01-28 06:51:14,682 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-01-28 06:51:14,683 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 207 flow [2023-01-28 06:51:14,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:14,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:14,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:51:14,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:14,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 258530671, now seen corresponding path program 4 times [2023-01-28 06:51:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019277013] [2023-01-28 06:51:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:51:15,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:15,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019277013] [2023-01-28 06:51:15,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019277013] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:51:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847718410] [2023-01-28 06:51:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:15,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:51:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:51:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:51:15,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 06:51:15,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:15,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:15,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 06:51:15,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:15,818 INFO L130 PetriNetUnfolder]: 177/361 cut-off events. [2023-01-28 06:51:15,818 INFO L131 PetriNetUnfolder]: For 818/818 co-relation queries the response was YES. [2023-01-28 06:51:15,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 361 events. 177/361 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1497 event pairs, 17 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1386. Up to 153 conditions per place. [2023-01-28 06:51:15,820 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 41 selfloop transitions, 7 changer transitions 27/75 dead transitions. [2023-01-28 06:51:15,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 575 flow [2023-01-28 06:51:15,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 06:51:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 06:51:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1006 transitions. [2023-01-28 06:51:15,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4280851063829787 [2023-01-28 06:51:15,823 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1006 transitions. [2023-01-28 06:51:15,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1006 transitions. [2023-01-28 06:51:15,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:15,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1006 transitions. [2023-01-28 06:51:15,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.6) internal successors, (1006), 10 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:15,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:15,829 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:15,829 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 207 flow. Second operand 10 states and 1006 transitions. [2023-01-28 06:51:15,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 575 flow [2023-01-28 06:51:15,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 533 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-01-28 06:51:15,837 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 204 flow [2023-01-28 06:51:15,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2023-01-28 06:51:15,838 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-01-28 06:51:15,838 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 204 flow [2023-01-28 06:51:15,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:15,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:15,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:15,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:51:15,839 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:15,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1295392597, now seen corresponding path program 5 times [2023-01-28 06:51:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067869849] [2023-01-28 06:51:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:51:15,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:51:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:51:16,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:51:16,004 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:51:16,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:51:16,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:51:16,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:51:16,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:51:16,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:51:16,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:51:16,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:51:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:51:16,012 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:16,017 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:51:16,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:51:16,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:51:16 BasicIcfg [2023-01-28 06:51:16,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:51:16,102 INFO L158 Benchmark]: Toolchain (without parser) took 19961.85ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 300.1MB in the beginning and 764.8MB in the end (delta: -464.7MB). Peak memory consumption was 573.6MB. Max. memory is 16.0GB. [2023-01-28 06:51:16,102 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:51:16,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.65ms. Allocated memory is still 354.4MB. Free memory was 299.9MB in the beginning and 319.2MB in the end (delta: -19.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. [2023-01-28 06:51:16,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.98ms. Allocated memory is still 354.4MB. Free memory was 318.6MB in the beginning and 315.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:51:16,103 INFO L158 Benchmark]: Boogie Preprocessor took 56.80ms. Allocated memory is still 354.4MB. Free memory was 315.9MB in the beginning and 313.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:51:16,103 INFO L158 Benchmark]: RCFGBuilder took 715.73ms. Allocated memory is still 354.4MB. Free memory was 313.9MB in the beginning and 274.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-01-28 06:51:16,104 INFO L158 Benchmark]: TraceAbstraction took 18630.58ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 273.6MB in the beginning and 764.8MB in the end (delta: -491.3MB). Peak memory consumption was 545.8MB. Max. memory is 16.0GB. [2023-01-28 06:51:16,105 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 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 478.65ms. Allocated memory is still 354.4MB. Free memory was 299.9MB in the beginning and 319.2MB in the end (delta: -19.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.98ms. Allocated memory is still 354.4MB. Free memory was 318.6MB in the beginning and 315.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 56.80ms. Allocated memory is still 354.4MB. Free memory was 315.9MB in the beginning and 313.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 715.73ms. Allocated memory is still 354.4MB. Free memory was 313.9MB in the beginning and 274.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 18630.58ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 273.6MB in the beginning and 764.8MB in the end (delta: -491.3MB). Peak memory consumption was 545.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 135 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 29 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3154, independent: 2962, independent conditional: 0, independent unconditional: 2962, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1429, independent: 1399, independent conditional: 0, independent unconditional: 1399, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3154, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1429, unknown conditional: 0, unknown unconditional: 1429] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-4, t469={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-3, t469={5:0}, t470={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-2, t469={5:0}, t470={6:0}, t471={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, t472={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 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) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 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 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 865]: 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: 869]: 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: 867]: 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: 871]: 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 9 procedures, 162 locations, 7 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: 18.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1942 IncrementalHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 57 mSDtfsCounter, 1942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=11, InterpolantAutomatonStates: 96, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:51:16,125 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...