/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:42:11,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:42:11,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:42:11,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:42:11,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:42:11,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:42:11,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:42:11,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:42:11,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:42:11,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:42:11,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:42:11,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:42:11,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:42:11,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:42:11,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:42:11,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:42:11,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:42:11,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:42:11,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:42:11,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:42:11,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:42:11,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:42:11,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:42:11,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:42:11,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:42:11,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:42:11,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:42:11,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:42:11,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:42:11,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:42:11,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:42:11,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:42:11,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:42:11,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:42:11,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:42:11,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:42:11,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:42:11,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:42:11,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:42:11,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:42:11,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:42:11,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:42:11,846 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:42:11,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:42:11,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:42:11,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:42:11,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:42:11,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:42:11,848 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:42:11,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:42:11,848 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:42:11,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:42:11,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:42:11,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:42:11,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:42:11,850 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:42:12,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:42:12,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:42:12,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:42:12,029 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:42:12,029 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:42:12,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-01-28 00:42:13,148 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:42:13,386 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:42:13,386 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-01-28 00:42:13,399 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7f6800b/ec9366e7979340008f63895200d44c4b/FLAGa3bccfe44 [2023-01-28 00:42:13,409 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7f6800b/ec9366e7979340008f63895200d44c4b [2023-01-28 00:42:13,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:42:13,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:42:13,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:42:13,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:42:13,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:42:13,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1488cf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13, skipping insertion in model container [2023-01-28 00:42:13,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:42:13,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:42:13,564 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/mix043.opt.i[944,957] [2023-01-28 00:42:13,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:42:13,754 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:42:13,763 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/mix043.opt.i[944,957] [2023-01-28 00:42:13,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:42:13,849 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:42:13,849 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:42:13,854 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:42:13,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13 WrapperNode [2023-01-28 00:42:13,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:42:13,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:42:13,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:42:13,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:42:13,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,892 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2023-01-28 00:42:13,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:42:13,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:42:13,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:42:13,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:42:13,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:42:13,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:42:13,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:42:13,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:42:13,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (1/1) ... [2023-01-28 00:42:13,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:42:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:42:13,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:42:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:42:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:42:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:42:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:42:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:42:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:42:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:42:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:42:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:42:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:42:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:42:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:42:13,963 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:42:14,056 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:42:14,057 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:42:14,373 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:42:14,505 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:42:14,505 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:42:14,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:42:14 BoogieIcfgContainer [2023-01-28 00:42:14,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:42:14,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:42:14,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:42:14,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:42:14,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:42:13" (1/3) ... [2023-01-28 00:42:14,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d44b5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:42:14, skipping insertion in model container [2023-01-28 00:42:14,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:42:13" (2/3) ... [2023-01-28 00:42:14,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d44b5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:42:14, skipping insertion in model container [2023-01-28 00:42:14,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:42:14" (3/3) ... [2023-01-28 00:42:14,512 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-01-28 00:42:14,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:42:14,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:42:14,523 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:42:14,566 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:42:14,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-01-28 00:42:14,647 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-28 00:42:14,647 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:14,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-28 00:42:14,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-01-28 00:42:14,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-01-28 00:42:14,660 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:42:14,676 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-28 00:42:14,677 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-28 00:42:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-01-28 00:42:14,708 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-28 00:42:14,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:14,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-28 00:42:14,711 INFO L119 LiptonReduction]: Number of co-enabled transitions 2936 [2023-01-28 00:42:17,845 INFO L134 LiptonReduction]: Checked pairs total: 7713 [2023-01-28 00:42:17,846 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-28 00:42:17,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:42:17,864 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;@5494907d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:42:17,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:42:17,871 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-28 00:42:17,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:42:17,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:17,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:17,872 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 00:42:17,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 279044779, now seen corresponding path program 1 times [2023-01-28 00:42:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918836601] [2023-01-28 00:42:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:18,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:18,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918836601] [2023-01-28 00:42:18,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918836601] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:42:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911788055] [2023-01-28 00:42:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:18,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:18,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:18,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 240 [2023-01-28 00:42:18,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:18,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:18,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 240 [2023-01-28 00:42:18,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:18,823 INFO L130 PetriNetUnfolder]: 3632/5264 cut-off events. [2023-01-28 00:42:18,823 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-01-28 00:42:18,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10357 conditions, 5264 events. 3632/5264 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 28817 event pairs, 668 based on Foata normal form. 180/5071 useless extension candidates. Maximal degree in co-relation 10345. Up to 3973 conditions per place. [2023-01-28 00:42:18,849 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-01-28 00:42:18,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 172 flow [2023-01-28 00:42:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-01-28 00:42:18,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2023-01-28 00:42:18,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-01-28 00:42:18,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-01-28 00:42:18,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:18,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-01-28 00:42:18,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:18,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 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 00:42:18,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 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 00:42:18,877 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 392 transitions. [2023-01-28 00:42:18,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 172 flow [2023-01-28 00:42:18,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:42:18,884 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-01-28 00:42:18,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-01-28 00:42:18,888 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 00:42:18,888 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-01-28 00:42:18,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:18,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:18,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:18,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:42:18,889 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 00:42:18,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2031876106, now seen corresponding path program 1 times [2023-01-28 00:42:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611049527] [2023-01-28 00:42:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611049527] [2023-01-28 00:42:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611049527] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:42:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725247274] [2023-01-28 00:42:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:19,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:19,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 240 [2023-01-28 00:42:19,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:19,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:19,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 240 [2023-01-28 00:42:19,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:20,140 INFO L130 PetriNetUnfolder]: 7591/10352 cut-off events. [2023-01-28 00:42:20,140 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2023-01-28 00:42:20,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21230 conditions, 10352 events. 7591/10352 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 47033 event pairs, 2087 based on Foata normal form. 480/10832 useless extension candidates. Maximal degree in co-relation 21220. Up to 6401 conditions per place. [2023-01-28 00:42:20,190 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 37 selfloop transitions, 2 changer transitions 26/65 dead transitions. [2023-01-28 00:42:20,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 274 flow [2023-01-28 00:42:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:42:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:42:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-01-28 00:42:20,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725 [2023-01-28 00:42:20,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-01-28 00:42:20,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-01-28 00:42:20,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:20,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-01-28 00:42:20,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:20,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:20,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:20,197 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 567 transitions. [2023-01-28 00:42:20,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 274 flow [2023-01-28 00:42:20,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:42:20,201 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 74 flow [2023-01-28 00:42:20,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, 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=5, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-01-28 00:42:20,202 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-01-28 00:42:20,202 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 74 flow [2023-01-28 00:42:20,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:20,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:20,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:20,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:42:20,202 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 00:42:20,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 347662768, now seen corresponding path program 1 times [2023-01-28 00:42:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726462208] [2023-01-28 00:42:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:21,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726462208] [2023-01-28 00:42:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726462208] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:21,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025169778] [2023-01-28 00:42:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:21,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 240 [2023-01-28 00:42:21,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:21,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:21,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 240 [2023-01-28 00:42:21,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:21,941 INFO L130 PetriNetUnfolder]: 7991/10880 cut-off events. [2023-01-28 00:42:21,941 INFO L131 PetriNetUnfolder]: For 1712/1712 co-relation queries the response was YES. [2023-01-28 00:42:21,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23689 conditions, 10880 events. 7991/10880 cut-off events. For 1712/1712 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 49766 event pairs, 1399 based on Foata normal form. 320/11200 useless extension candidates. Maximal degree in co-relation 23676. Up to 7657 conditions per place. [2023-01-28 00:42:21,983 INFO L137 encePairwiseOnDemand]: 230/240 looper letters, 63 selfloop transitions, 14 changer transitions 34/111 dead transitions. [2023-01-28 00:42:21,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 111 transitions, 478 flow [2023-01-28 00:42:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:42:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:42:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1014 transitions. [2023-01-28 00:42:21,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2023-01-28 00:42:21,986 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1014 transitions. [2023-01-28 00:42:21,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1014 transitions. [2023-01-28 00:42:21,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:21,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1014 transitions. [2023-01-28 00:42:21,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:21,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:21,991 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:21,992 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 74 flow. Second operand 9 states and 1014 transitions. [2023-01-28 00:42:21,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 111 transitions, 478 flow [2023-01-28 00:42:22,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 111 transitions, 466 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:42:22,060 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 161 flow [2023-01-28 00:42:22,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=161, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-01-28 00:42:22,061 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-01-28 00:42:22,063 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 161 flow [2023-01-28 00:42:22,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:22,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:22,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:22,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:42:22,064 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 00:42:22,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1578328978, now seen corresponding path program 2 times [2023-01-28 00:42:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057926035] [2023-01-28 00:42:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:22,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:22,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057926035] [2023-01-28 00:42:22,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057926035] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:22,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:22,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:42:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490411928] [2023-01-28 00:42:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:22,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:42:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:42:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:42:22,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-01-28 00:42:22,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:22,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:22,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-01-28 00:42:22,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:22,945 INFO L130 PetriNetUnfolder]: 3751/5439 cut-off events. [2023-01-28 00:42:22,945 INFO L131 PetriNetUnfolder]: For 2906/3006 co-relation queries the response was YES. [2023-01-28 00:42:22,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13892 conditions, 5439 events. 3751/5439 cut-off events. For 2906/3006 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29093 event pairs, 853 based on Foata normal form. 190/5455 useless extension candidates. Maximal degree in co-relation 13875. Up to 3952 conditions per place. [2023-01-28 00:42:22,964 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 59 selfloop transitions, 12 changer transitions 2/78 dead transitions. [2023-01-28 00:42:22,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 408 flow [2023-01-28 00:42:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:42:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:42:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2023-01-28 00:42:22,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2023-01-28 00:42:22,966 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 725 transitions. [2023-01-28 00:42:22,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions. [2023-01-28 00:42:22,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:22,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions. [2023-01-28 00:42:22,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:22,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:22,969 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:22,969 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 161 flow. Second operand 6 states and 725 transitions. [2023-01-28 00:42:22,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 408 flow [2023-01-28 00:42:22,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 402 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:22,987 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 248 flow [2023-01-28 00:42:22,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-01-28 00:42:22,988 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-01-28 00:42:22,988 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 248 flow [2023-01-28 00:42:22,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:22,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:22,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:22,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:42:22,988 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 00:42:22,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash 104044534, now seen corresponding path program 1 times [2023-01-28 00:42:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160788786] [2023-01-28 00:42:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:23,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:23,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160788786] [2023-01-28 00:42:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160788786] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:23,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:23,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:23,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003951883] [2023-01-28 00:42:23,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:23,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:23,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 240 [2023-01-28 00:42:23,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:23,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:23,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 240 [2023-01-28 00:42:23,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:24,282 INFO L130 PetriNetUnfolder]: 8071/11088 cut-off events. [2023-01-28 00:42:24,282 INFO L131 PetriNetUnfolder]: For 9520/9520 co-relation queries the response was YES. [2023-01-28 00:42:24,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31734 conditions, 11088 events. 8071/11088 cut-off events. For 9520/9520 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 52177 event pairs, 877 based on Foata normal form. 192/11280 useless extension candidates. Maximal degree in co-relation 31714. Up to 8413 conditions per place. [2023-01-28 00:42:24,327 INFO L137 encePairwiseOnDemand]: 229/240 looper letters, 81 selfloop transitions, 25 changer transitions 25/131 dead transitions. [2023-01-28 00:42:24,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 131 transitions, 788 flow [2023-01-28 00:42:24,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:42:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:42:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1011 transitions. [2023-01-28 00:42:24,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46805555555555556 [2023-01-28 00:42:24,329 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1011 transitions. [2023-01-28 00:42:24,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1011 transitions. [2023-01-28 00:42:24,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:24,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1011 transitions. [2023-01-28 00:42:24,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:24,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:24,334 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:24,334 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 248 flow. Second operand 9 states and 1011 transitions. [2023-01-28 00:42:24,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 131 transitions, 788 flow [2023-01-28 00:42:24,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 131 transitions, 778 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-01-28 00:42:24,389 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 404 flow [2023-01-28 00:42:24,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=404, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2023-01-28 00:42:24,389 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-01-28 00:42:24,389 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 404 flow [2023-01-28 00:42:24,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:24,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:24,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:24,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:42:24,390 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 00:42:24,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1755694, now seen corresponding path program 2 times [2023-01-28 00:42:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727760182] [2023-01-28 00:42:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727760182] [2023-01-28 00:42:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727760182] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:24,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:24,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735061992] [2023-01-28 00:42:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:24,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-01-28 00:42:24,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 404 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:24,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:24,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-01-28 00:42:24,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:25,370 INFO L130 PetriNetUnfolder]: 5085/7506 cut-off events. [2023-01-28 00:42:25,371 INFO L131 PetriNetUnfolder]: For 14297/14367 co-relation queries the response was YES. [2023-01-28 00:42:25,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25394 conditions, 7506 events. 5085/7506 cut-off events. For 14297/14367 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 40896 event pairs, 925 based on Foata normal form. 126/7549 useless extension candidates. Maximal degree in co-relation 25366. Up to 5177 conditions per place. [2023-01-28 00:42:25,406 INFO L137 encePairwiseOnDemand]: 232/240 looper letters, 68 selfloop transitions, 20 changer transitions 1/98 dead transitions. [2023-01-28 00:42:25,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 741 flow [2023-01-28 00:42:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:42:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:42:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2023-01-28 00:42:25,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2023-01-28 00:42:25,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2023-01-28 00:42:25,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2023-01-28 00:42:25,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:25,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2023-01-28 00:42:25,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:25,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:25,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:25,411 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 404 flow. Second operand 6 states and 716 transitions. [2023-01-28 00:42:25,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 741 flow [2023-01-28 00:42:25,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 700 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 00:42:25,451 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 512 flow [2023-01-28 00:42:25,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=512, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2023-01-28 00:42:25,453 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-01-28 00:42:25,453 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 512 flow [2023-01-28 00:42:25,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:25,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:25,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:25,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:42:25,454 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 00:42:25,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2131024174, now seen corresponding path program 3 times [2023-01-28 00:42:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128175949] [2023-01-28 00:42:25,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128175949] [2023-01-28 00:42:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128175949] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:25,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055798093] [2023-01-28 00:42:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:25,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:42:25,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:25,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:42:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:42:25,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-01-28 00:42:25,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 512 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:25,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:25,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-01-28 00:42:25,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:26,583 INFO L130 PetriNetUnfolder]: 6062/8975 cut-off events. [2023-01-28 00:42:26,583 INFO L131 PetriNetUnfolder]: For 23839/23907 co-relation queries the response was YES. [2023-01-28 00:42:26,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32503 conditions, 8975 events. 6062/8975 cut-off events. For 23839/23907 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 51045 event pairs, 655 based on Foata normal form. 250/9124 useless extension candidates. Maximal degree in co-relation 32474. Up to 4630 conditions per place. [2023-01-28 00:42:26,647 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 75 selfloop transitions, 29 changer transitions 1/114 dead transitions. [2023-01-28 00:42:26,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 920 flow [2023-01-28 00:42:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:42:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:42:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 962 transitions. [2023-01-28 00:42:26,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010416666666667 [2023-01-28 00:42:26,650 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 962 transitions. [2023-01-28 00:42:26,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 962 transitions. [2023-01-28 00:42:26,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:26,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 962 transitions. [2023-01-28 00:42:26,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:26,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:26,654 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:26,654 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 512 flow. Second operand 8 states and 962 transitions. [2023-01-28 00:42:26,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 920 flow [2023-01-28 00:42:26,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 866 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-01-28 00:42:26,779 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 628 flow [2023-01-28 00:42:26,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=628, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2023-01-28 00:42:26,780 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-01-28 00:42:26,780 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 628 flow [2023-01-28 00:42:26,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:26,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:26,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:26,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:42:26,781 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 00:42:26,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 165295899, now seen corresponding path program 1 times [2023-01-28 00:42:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:26,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559093452] [2023-01-28 00:42:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559093452] [2023-01-28 00:42:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559093452] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:42:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339445661] [2023-01-28 00:42:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:26,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:42:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:42:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:42:26,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-01-28 00:42:26,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 628 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 00:42:26,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:26,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-01-28 00:42:26,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:27,395 INFO L130 PetriNetUnfolder]: 3539/5422 cut-off events. [2023-01-28 00:42:27,395 INFO L131 PetriNetUnfolder]: For 24178/24436 co-relation queries the response was YES. [2023-01-28 00:42:27,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21825 conditions, 5422 events. 3539/5422 cut-off events. For 24178/24436 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 30889 event pairs, 814 based on Foata normal form. 210/5512 useless extension candidates. Maximal degree in co-relation 21793. Up to 4719 conditions per place. [2023-01-28 00:42:27,419 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 80 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2023-01-28 00:42:27,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 999 flow [2023-01-28 00:42:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:42:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:42:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-01-28 00:42:27,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236111111111111 [2023-01-28 00:42:27,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-01-28 00:42:27,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-01-28 00:42:27,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:27,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-01-28 00:42:27,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:27,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 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 00:42:27,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 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 00:42:27,423 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 628 flow. Second operand 3 states and 377 transitions. [2023-01-28 00:42:27,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 999 flow [2023-01-28 00:42:27,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 940 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:27,470 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 590 flow [2023-01-28 00:42:27,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2023-01-28 00:42:27,471 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-01-28 00:42:27,472 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 590 flow [2023-01-28 00:42:27,472 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 00:42:27,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:27,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:27,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:42:27,472 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 00:42:27,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1500412675, now seen corresponding path program 1 times [2023-01-28 00:42:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:27,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931552572] [2023-01-28 00:42:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931552572] [2023-01-28 00:42:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931552572] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:42:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162408187] [2023-01-28 00:42:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:27,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:42:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:27,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:42:27,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:42:27,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-01-28 00:42:27,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 590 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:27,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:27,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-01-28 00:42:27,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:27,858 INFO L130 PetriNetUnfolder]: 1722/2803 cut-off events. [2023-01-28 00:42:27,858 INFO L131 PetriNetUnfolder]: For 10637/10775 co-relation queries the response was YES. [2023-01-28 00:42:27,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11839 conditions, 2803 events. 1722/2803 cut-off events. For 10637/10775 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15216 event pairs, 283 based on Foata normal form. 239/2967 useless extension candidates. Maximal degree in co-relation 11807. Up to 1461 conditions per place. [2023-01-28 00:42:27,871 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 102 selfloop transitions, 9 changer transitions 1/127 dead transitions. [2023-01-28 00:42:27,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 1234 flow [2023-01-28 00:42:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:42:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:42:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-01-28 00:42:27,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2023-01-28 00:42:27,873 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-01-28 00:42:27,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-01-28 00:42:27,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:27,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-01-28 00:42:27,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:27,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:27,876 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:27,876 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 590 flow. Second operand 4 states and 504 transitions. [2023-01-28 00:42:27,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 1234 flow [2023-01-28 00:42:27,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 1215 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-01-28 00:42:27,890 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 617 flow [2023-01-28 00:42:27,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2023-01-28 00:42:27,891 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-01-28 00:42:27,891 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 617 flow [2023-01-28 00:42:27,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:27,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:27,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:27,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:42:27,891 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 00:42:27,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1625133881, now seen corresponding path program 1 times [2023-01-28 00:42:27,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:27,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27454360] [2023-01-28 00:42:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27454360] [2023-01-28 00:42:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27454360] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259263304] [2023-01-28 00:42:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:28,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:42:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:42:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:42:28,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 240 [2023-01-28 00:42:28,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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 00:42:28,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:28,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 240 [2023-01-28 00:42:28,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:28,803 INFO L130 PetriNetUnfolder]: 3671/5610 cut-off events. [2023-01-28 00:42:28,803 INFO L131 PetriNetUnfolder]: For 23340/23340 co-relation queries the response was YES. [2023-01-28 00:42:28,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25428 conditions, 5610 events. 3671/5610 cut-off events. For 23340/23340 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 29082 event pairs, 568 based on Foata normal form. 60/5670 useless extension candidates. Maximal degree in co-relation 25394. Up to 3271 conditions per place. [2023-01-28 00:42:28,826 INFO L137 encePairwiseOnDemand]: 231/240 looper letters, 132 selfloop transitions, 15 changer transitions 59/206 dead transitions. [2023-01-28 00:42:28,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 206 transitions, 1998 flow [2023-01-28 00:42:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 786 transitions. [2023-01-28 00:42:28,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2023-01-28 00:42:28,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 786 transitions. [2023-01-28 00:42:28,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 786 transitions. [2023-01-28 00:42:28,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:28,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 786 transitions. [2023-01-28 00:42:28,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:28,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:28,845 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:28,845 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 617 flow. Second operand 7 states and 786 transitions. [2023-01-28 00:42:28,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 206 transitions, 1998 flow [2023-01-28 00:42:28,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 206 transitions, 1946 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:28,885 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 697 flow [2023-01-28 00:42:28,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=697, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2023-01-28 00:42:28,886 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-01-28 00:42:28,886 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 697 flow [2023-01-28 00:42:28,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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 00:42:28,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:28,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] [2023-01-28 00:42:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:42:28,887 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 00:42:28,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 578264152, now seen corresponding path program 1 times [2023-01-28 00:42:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897912116] [2023-01-28 00:42:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897912116] [2023-01-28 00:42:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897912116] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:29,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:42:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841273409] [2023-01-28 00:42:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:29,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:29,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-01-28 00:42:29,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 697 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:29,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:29,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-01-28 00:42:29,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:29,286 INFO L130 PetriNetUnfolder]: 1506/2457 cut-off events. [2023-01-28 00:42:29,287 INFO L131 PetriNetUnfolder]: For 10234/10387 co-relation queries the response was YES. [2023-01-28 00:42:29,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10605 conditions, 2457 events. 1506/2457 cut-off events. For 10234/10387 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13365 event pairs, 205 based on Foata normal form. 199/2581 useless extension candidates. Maximal degree in co-relation 10567. Up to 926 conditions per place. [2023-01-28 00:42:29,300 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 96 selfloop transitions, 13 changer transitions 5/132 dead transitions. [2023-01-28 00:42:29,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 1344 flow [2023-01-28 00:42:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:42:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:42:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-01-28 00:42:29,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241666666666667 [2023-01-28 00:42:29,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-01-28 00:42:29,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-01-28 00:42:29,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:29,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-01-28 00:42:29,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:29,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:29,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:29,305 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 697 flow. Second operand 5 states and 629 transitions. [2023-01-28 00:42:29,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 1344 flow [2023-01-28 00:42:29,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 132 transitions, 1183 flow, removed 24 selfloop flow, removed 12 redundant places. [2023-01-28 00:42:29,320 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 577 flow [2023-01-28 00:42:29,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-01-28 00:42:29,320 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-01-28 00:42:29,321 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 577 flow [2023-01-28 00:42:29,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:29,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:29,321 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 00:42:29,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:42:29,321 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 00:42:29,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1017075620, now seen corresponding path program 1 times [2023-01-28 00:42:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404408377] [2023-01-28 00:42:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404408377] [2023-01-28 00:42:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404408377] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889250204] [2023-01-28 00:42:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:29,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:42:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:42:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:42:29,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 240 [2023-01-28 00:42:29,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:29,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:29,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 240 [2023-01-28 00:42:29,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:30,109 INFO L130 PetriNetUnfolder]: 3330/5100 cut-off events. [2023-01-28 00:42:30,109 INFO L131 PetriNetUnfolder]: For 18521/18521 co-relation queries the response was YES. [2023-01-28 00:42:30,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23055 conditions, 5100 events. 3330/5100 cut-off events. For 18521/18521 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 27012 event pairs, 430 based on Foata normal form. 15/5115 useless extension candidates. Maximal degree in co-relation 23023. Up to 2727 conditions per place. [2023-01-28 00:42:30,124 INFO L137 encePairwiseOnDemand]: 232/240 looper letters, 113 selfloop transitions, 16 changer transitions 68/197 dead transitions. [2023-01-28 00:42:30,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 197 transitions, 1902 flow [2023-01-28 00:42:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:42:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:42:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2023-01-28 00:42:30,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46904761904761905 [2023-01-28 00:42:30,126 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 788 transitions. [2023-01-28 00:42:30,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 788 transitions. [2023-01-28 00:42:30,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:30,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 788 transitions. [2023-01-28 00:42:30,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,129 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,129 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 577 flow. Second operand 7 states and 788 transitions. [2023-01-28 00:42:30,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 197 transitions, 1902 flow [2023-01-28 00:42:30,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 197 transitions, 1812 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:30,178 INFO L231 Difference]: Finished difference. Result has 82 places, 75 transitions, 615 flow [2023-01-28 00:42:30,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=615, PETRI_PLACES=82, PETRI_TRANSITIONS=75} [2023-01-28 00:42:30,178 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-01-28 00:42:30,178 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 75 transitions, 615 flow [2023-01-28 00:42:30,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:30,179 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 00:42:30,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:42:30,179 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 00:42:30,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 533145116, now seen corresponding path program 2 times [2023-01-28 00:42:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:30,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308122200] [2023-01-28 00:42:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:30,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308122200] [2023-01-28 00:42:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308122200] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:30,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:42:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495548013] [2023-01-28 00:42:30,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:30,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:42:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:30,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:42:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:42:30,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-01-28 00:42:30,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 75 transitions, 615 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:30,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-01-28 00:42:30,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:30,591 INFO L130 PetriNetUnfolder]: 1832/2968 cut-off events. [2023-01-28 00:42:30,591 INFO L131 PetriNetUnfolder]: For 9791/10031 co-relation queries the response was YES. [2023-01-28 00:42:30,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12433 conditions, 2968 events. 1832/2968 cut-off events. For 9791/10031 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 17512 event pairs, 203 based on Foata normal form. 186/3055 useless extension candidates. Maximal degree in co-relation 12405. Up to 1131 conditions per place. [2023-01-28 00:42:30,601 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 64 selfloop transitions, 17 changer transitions 47/134 dead transitions. [2023-01-28 00:42:30,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 1282 flow [2023-01-28 00:42:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:42:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:42:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-01-28 00:42:30,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145833333333333 [2023-01-28 00:42:30,603 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-01-28 00:42:30,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-01-28 00:42:30,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:30,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-01-28 00:42:30,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,606 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,606 INFO L175 Difference]: Start difference. First operand has 82 places, 75 transitions, 615 flow. Second operand 6 states and 741 transitions. [2023-01-28 00:42:30,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 1282 flow [2023-01-28 00:42:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 1218 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-01-28 00:42:30,649 INFO L231 Difference]: Finished difference. Result has 84 places, 53 transitions, 395 flow [2023-01-28 00:42:30,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=84, PETRI_TRANSITIONS=53} [2023-01-28 00:42:30,650 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-01-28 00:42:30,650 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 53 transitions, 395 flow [2023-01-28 00:42:30,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:30,651 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, 1] [2023-01-28 00:42:30,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:42:30,651 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 00:42:30,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1359530217, now seen corresponding path program 1 times [2023-01-28 00:42:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842227084] [2023-01-28 00:42:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:42:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:42:30,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:42:30,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842227084] [2023-01-28 00:42:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842227084] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:42:30,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:42:30,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:42:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983327685] [2023-01-28 00:42:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:42:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:42:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:42:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:42:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:42:30,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-01-28 00:42:30,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 53 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:42:30,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-01-28 00:42:30,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:42:30,982 INFO L130 PetriNetUnfolder]: 1069/1776 cut-off events. [2023-01-28 00:42:30,982 INFO L131 PetriNetUnfolder]: For 6154/6202 co-relation queries the response was YES. [2023-01-28 00:42:30,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7773 conditions, 1776 events. 1069/1776 cut-off events. For 6154/6202 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9703 event pairs, 253 based on Foata normal form. 17/1745 useless extension candidates. Maximal degree in co-relation 7750. Up to 891 conditions per place. [2023-01-28 00:42:30,988 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 49 selfloop transitions, 1 changer transitions 49/103 dead transitions. [2023-01-28 00:42:30,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 958 flow [2023-01-28 00:42:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:42:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:42:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-01-28 00:42:30,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-01-28 00:42:30,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-01-28 00:42:30,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-01-28 00:42:30,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:42:30,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-01-28 00:42:30,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,992 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:30,992 INFO L175 Difference]: Start difference. First operand has 84 places, 53 transitions, 395 flow. Second operand 5 states and 610 transitions. [2023-01-28 00:42:30,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 958 flow [2023-01-28 00:42:31,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 774 flow, removed 42 selfloop flow, removed 14 redundant places. [2023-01-28 00:42:31,009 INFO L231 Difference]: Finished difference. Result has 73 places, 44 transitions, 243 flow [2023-01-28 00:42:31,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=73, PETRI_TRANSITIONS=44} [2023-01-28 00:42:31,009 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-01-28 00:42:31,009 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 44 transitions, 243 flow [2023-01-28 00:42:31,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:42:31,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:42:31,010 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, 1] [2023-01-28 00:42:31,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:42:31,010 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 00:42:31,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:42:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1345403347, now seen corresponding path program 2 times [2023-01-28 00:42:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:42:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100463145] [2023-01-28 00:42:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:42:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:42:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:42:31,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:42:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:42:31,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:42:31,080 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:42:31,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:42:31,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:42:31,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:42:31,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:42:31,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:42:31,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:42:31,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:42:31,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:42:31,082 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 00:42:31,086 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:42:31,086 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:42:31,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:42:31 BasicIcfg [2023-01-28 00:42:31,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:42:31,141 INFO L158 Benchmark]: Toolchain (without parser) took 17728.87ms. Allocated memory was 593.5MB in the beginning and 1.3GB in the end (delta: 744.5MB). Free memory was 552.4MB in the beginning and 605.3MB in the end (delta: -52.9MB). Peak memory consumption was 694.8MB. Max. memory is 16.0GB. [2023-01-28 00:42:31,141 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 400.6MB. Free memory is still 350.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:42:31,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.86ms. Allocated memory is still 593.5MB. Free memory was 552.1MB in the beginning and 528.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:42:31,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.08ms. Allocated memory is still 593.5MB. Free memory was 528.9MB in the beginning and 526.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:42:31,141 INFO L158 Benchmark]: Boogie Preprocessor took 20.12ms. Allocated memory is still 593.5MB. Free memory was 526.2MB in the beginning and 524.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:42:31,142 INFO L158 Benchmark]: RCFGBuilder took 593.05ms. Allocated memory is still 593.5MB. Free memory was 524.1MB in the beginning and 552.1MB in the end (delta: -28.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.0GB. [2023-01-28 00:42:31,142 INFO L158 Benchmark]: TraceAbstraction took 16632.10ms. Allocated memory was 593.5MB in the beginning and 1.3GB in the end (delta: 744.5MB). Free memory was 551.0MB in the beginning and 605.3MB in the end (delta: -54.3MB). Peak memory consumption was 690.2MB. Max. memory is 16.0GB. [2023-01-28 00:42:31,142 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.09ms. Allocated memory is still 400.6MB. Free memory is still 350.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 441.86ms. Allocated memory is still 593.5MB. Free memory was 552.1MB in the beginning and 528.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.08ms. Allocated memory is still 593.5MB. Free memory was 528.9MB in the beginning and 526.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.12ms. Allocated memory is still 593.5MB. Free memory was 526.2MB in the beginning and 524.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 593.05ms. Allocated memory is still 593.5MB. Free memory was 524.1MB in the beginning and 552.1MB in the end (delta: -28.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.0GB. * TraceAbstraction took 16632.10ms. Allocated memory was 593.5MB in the beginning and 1.3GB in the end (delta: 744.5MB). Free memory was 551.0MB in the beginning and 605.3MB in the end (delta: -54.3MB). Peak memory consumption was 690.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 7713 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3383, independent: 3166, independent conditional: 0, independent unconditional: 3166, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1554, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3383, independent: 1645, independent conditional: 0, independent unconditional: 1645, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 1554, unknown conditional: 0, unknown unconditional: 1554] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={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] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={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] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={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] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={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] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L826] 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) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 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 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 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 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 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_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] 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_p0_EAX=0, __unbuffered_p1_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}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 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: 16.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 59 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=10, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1988 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 00:42:31,164 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...