/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:10:35,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:10:35,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:10:35,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:10:35,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:10:35,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:10:35,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:10:35,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:10:35,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:10:35,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:10:35,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:10:35,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:10:35,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:10:35,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:10:35,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:10:35,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:10:35,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:10:35,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:10:35,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:10:35,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:10:35,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:10:35,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:10:35,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:10:35,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:10:35,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:10:35,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:10:35,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:10:35,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:10:35,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:10:35,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:10:35,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:10:35,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:10:35,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:10:35,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:10:35,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:10:35,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:10:35,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:10:35,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:10:35,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:10:35,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:10:35,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:10:35,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:10:35,251 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:10:35,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:10:35,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:10:35,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:10:35,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:10:35,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:10:35,253 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:10:35,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:10:35,254 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:10:35,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:10:35,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:10:35,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:10:35,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:10:35,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:10:35,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:10:35,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:10:35,257 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:10:35,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:10:35,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:10:35,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:10:35,752 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:10:35,753 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:10:35,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:10:37,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:10:37,776 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:10:37,777 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:10:37,819 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897c0b9e5/e1c70873e6044c70b90f323a2756557d/FLAGbe2cfdd65 [2023-01-27 18:10:37,851 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897c0b9e5/e1c70873e6044c70b90f323a2756557d [2023-01-27 18:10:37,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:10:37,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:10:37,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:10:37,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:10:37,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:10:37,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:10:37" (1/1) ... [2023-01-27 18:10:37,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1c06b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:37, skipping insertion in model container [2023-01-27 18:10:37,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:10:37" (1/1) ... [2023-01-27 18:10:37,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:10:37,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:10:38,260 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-01-27 18:10:38,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:10:38,634 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:10:38,662 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-01-27 18:10:38,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:10:38,799 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:10:38,799 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:10:38,818 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:10:38,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38 WrapperNode [2023-01-27 18:10:38,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:10:38,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:10:38,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:10:38,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:10:38,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:38,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:38,959 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-01-27 18:10:38,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:10:38,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:10:38,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:10:38,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:10:38,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:38,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:38,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:38,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:39,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:39,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:39,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:39,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:39,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:10:39,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:10:39,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:10:39,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:10:39,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (1/1) ... [2023-01-27 18:10:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:10:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:10:39,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:10:39,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:10:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:10:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:10:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:10:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:10:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:10:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:10:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:10:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:10:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:10:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:10:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:10:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:10:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:10:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:10:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:10:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:10:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:10:39,265 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:10:39,565 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:10:39,566 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:10:40,100 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:10:40,231 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:10:40,231 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:10:40,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:10:40 BoogieIcfgContainer [2023-01-27 18:10:40,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:10:40,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:10:40,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:10:40,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:10:40,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:10:37" (1/3) ... [2023-01-27 18:10:40,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ee28f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:10:40, skipping insertion in model container [2023-01-27 18:10:40,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:38" (2/3) ... [2023-01-27 18:10:40,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ee28f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:10:40, skipping insertion in model container [2023-01-27 18:10:40,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:10:40" (3/3) ... [2023-01-27 18:10:40,239 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:10:40,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:10:40,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:10:40,251 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:10:40,296 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:10:40,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:10:40,399 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:10:40,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:10:40,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:10:40,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:10:40,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-01-27 18:10:40,433 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:10:40,442 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:10:40,445 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:10:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-01-27 18:10:40,501 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:10:40,501 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:10:40,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:10:40,504 INFO L119 LiptonReduction]: Number of co-enabled transitions 2986 [2023-01-27 18:10:47,095 INFO L134 LiptonReduction]: Checked pairs total: 8489 [2023-01-27 18:10:47,099 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-27 18:10:47,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:10:47,141 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;@49ccbdbb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:10:47,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:10:47,154 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-01-27 18:10:47,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:10:47,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:10:47,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:10:47,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:10:47,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:10:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1745103999, now seen corresponding path program 1 times [2023-01-27 18:10:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:10:47,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701165217] [2023-01-27 18:10:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:10:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:10:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:10:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:10:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:10:47,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701165217] [2023-01-27 18:10:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701165217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:10:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:10:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:10:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725519195] [2023-01-27 18:10:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:10:47,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:10:47,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:10:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:10:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:10:47,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-01-27 18:10:47,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:47,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:10:47,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-01-27 18:10:47,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:10:48,872 INFO L130 PetriNetUnfolder]: 3975/5715 cut-off events. [2023-01-27 18:10:48,872 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-01-27 18:10:48,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11295 conditions, 5715 events. 3975/5715 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30661 event pairs, 1089 based on Foata normal form. 192/5483 useless extension candidates. Maximal degree in co-relation 11283. Up to 4303 conditions per place. [2023-01-27 18:10:48,931 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2023-01-27 18:10:48,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2023-01-27 18:10:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:10:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:10:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-01-27 18:10:48,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475177304964539 [2023-01-27 18:10:48,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-01-27 18:10:48,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-01-27 18:10:48,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:10:48,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-01-27 18:10:48,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:48,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:48,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:48,984 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 386 transitions. [2023-01-27 18:10:48,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2023-01-27 18:10:48,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:10:48,989 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-01-27 18:10:48,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-01-27 18:10:48,993 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-27 18:10:48,993 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-01-27 18:10:48,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:48,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:10:48,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:10:48,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:10:48,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:10:49,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:10:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2095058766, now seen corresponding path program 1 times [2023-01-27 18:10:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:10:49,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945877826] [2023-01-27 18:10:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:10:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:10:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:10:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:10:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:10:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945877826] [2023-01-27 18:10:49,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945877826] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:10:49,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:10:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:10:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457981162] [2023-01-27 18:10:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:10:49,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:10:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:10:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:10:49,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:10:49,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:10:49,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:49,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:10:49,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:10:49,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:10:50,722 INFO L130 PetriNetUnfolder]: 4995/7107 cut-off events. [2023-01-27 18:10:50,723 INFO L131 PetriNetUnfolder]: For 351/351 co-relation queries the response was YES. [2023-01-27 18:10:50,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14521 conditions, 7107 events. 4995/7107 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 37812 event pairs, 1313 based on Foata normal form. 300/7403 useless extension candidates. Maximal degree in co-relation 14511. Up to 5574 conditions per place. [2023-01-27 18:10:50,959 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 34 selfloop transitions, 3 changer transitions 22/62 dead transitions. [2023-01-27 18:10:50,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 262 flow [2023-01-27 18:10:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:10:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:10:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-01-27 18:10:50,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157446808510638 [2023-01-27 18:10:50,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-01-27 18:10:50,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-01-27 18:10:50,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:10:50,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-01-27 18:10:50,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:51,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:51,022 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:51,022 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 606 transitions. [2023-01-27 18:10:51,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 262 flow [2023-01-27 18:10:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 62 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:10:51,024 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-01-27 18:10:51,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-01-27 18:10:51,025 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-01-27 18:10:51,025 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-01-27 18:10:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:51,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:10:51,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:10:51,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:10:51,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:10:51,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:10:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 522280250, now seen corresponding path program 1 times [2023-01-27 18:10:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:10:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208553086] [2023-01-27 18:10:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:10:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:10:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:10:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:10:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:10:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208553086] [2023-01-27 18:10:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208553086] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:10:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:10:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:10:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119928333] [2023-01-27 18:10:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:10:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:10:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:10:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:10:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:10:52,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:10:52,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:52,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:10:52,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:10:52,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:10:54,516 INFO L130 PetriNetUnfolder]: 10941/14830 cut-off events. [2023-01-27 18:10:54,517 INFO L131 PetriNetUnfolder]: For 4568/4568 co-relation queries the response was YES. [2023-01-27 18:10:54,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33557 conditions, 14830 events. 10941/14830 cut-off events. For 4568/4568 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 70759 event pairs, 2589 based on Foata normal form. 640/15470 useless extension candidates. Maximal degree in co-relation 33544. Up to 8561 conditions per place. [2023-01-27 18:10:54,762 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 48 selfloop transitions, 9 changer transitions 40/97 dead transitions. [2023-01-27 18:10:54,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 97 transitions, 443 flow [2023-01-27 18:10:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:10:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:10:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-01-27 18:10:54,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-01-27 18:10:54,765 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-01-27 18:10:54,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-01-27 18:10:54,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:10:54,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-01-27 18:10:54,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:54,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:54,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:54,808 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 7 states and 770 transitions. [2023-01-27 18:10:54,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 97 transitions, 443 flow [2023-01-27 18:10:54,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 97 transitions, 432 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-27 18:10:54,952 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 174 flow [2023-01-27 18:10:54,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-01-27 18:10:54,953 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-01-27 18:10:54,955 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 174 flow [2023-01-27 18:10:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:54,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:10:54,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:10:54,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:10:54,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:10:54,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:10:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1629075003, now seen corresponding path program 1 times [2023-01-27 18:10:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:10:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441216748] [2023-01-27 18:10:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:10:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:10:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:10:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:10:55,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:10:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441216748] [2023-01-27 18:10:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441216748] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:10:55,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:10:55,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:10:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385568827] [2023-01-27 18:10:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:10:55,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:10:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:10:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:10:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:10:55,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-27 18:10:55,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:55,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:10:55,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-27 18:10:55,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:10:57,906 INFO L130 PetriNetUnfolder]: 7688/11067 cut-off events. [2023-01-27 18:10:57,906 INFO L131 PetriNetUnfolder]: For 17857/18226 co-relation queries the response was YES. [2023-01-27 18:10:58,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34215 conditions, 11067 events. 7688/11067 cut-off events. For 17857/18226 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 61660 event pairs, 2881 based on Foata normal form. 465/11178 useless extension candidates. Maximal degree in co-relation 34196. Up to 7930 conditions per place. [2023-01-27 18:10:58,163 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 40 selfloop transitions, 3 changer transitions 22/73 dead transitions. [2023-01-27 18:10:58,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 422 flow [2023-01-27 18:10:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:10:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:10:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-01-27 18:10:58,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505531914893617 [2023-01-27 18:10:58,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-01-27 18:10:58,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-01-27 18:10:58,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:10:58,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-01-27 18:10:58,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:58,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:58,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:58,172 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 174 flow. Second operand 5 states and 594 transitions. [2023-01-27 18:10:58,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 422 flow [2023-01-27 18:10:58,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 414 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-27 18:10:58,403 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 193 flow [2023-01-27 18:10:58,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-01-27 18:10:58,414 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-01-27 18:10:58,414 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 193 flow [2023-01-27 18:10:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:58,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:10:58,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:10:58,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:10:58,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:10:58,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:10:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1038300100, now seen corresponding path program 1 times [2023-01-27 18:10:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:10:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631067439] [2023-01-27 18:10:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:10:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:10:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:10:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:10:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:10:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631067439] [2023-01-27 18:10:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631067439] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:10:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:10:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:10:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944701218] [2023-01-27 18:10:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:10:59,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:10:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:10:59,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:10:59,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:10:59,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-01-27 18:10:59,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:10:59,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:10:59,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-01-27 18:10:59,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:01,368 INFO L130 PetriNetUnfolder]: 7382/10503 cut-off events. [2023-01-27 18:11:01,369 INFO L131 PetriNetUnfolder]: For 18508/19152 co-relation queries the response was YES. [2023-01-27 18:11:01,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34148 conditions, 10503 events. 7382/10503 cut-off events. For 18508/19152 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 56771 event pairs, 2899 based on Foata normal form. 481/10629 useless extension candidates. Maximal degree in co-relation 34127. Up to 7609 conditions per place. [2023-01-27 18:11:01,533 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 50 selfloop transitions, 9 changer transitions 22/89 dead transitions. [2023-01-27 18:11:01,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 561 flow [2023-01-27 18:11:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:11:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:11:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2023-01-27 18:11:01,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49858156028368794 [2023-01-27 18:11:01,535 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 703 transitions. [2023-01-27 18:11:01,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions. [2023-01-27 18:11:01,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:01,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions. [2023-01-27 18:11:01,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:01,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:01,538 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:01,539 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 193 flow. Second operand 6 states and 703 transitions. [2023-01-27 18:11:01,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 561 flow [2023-01-27 18:11:01,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 554 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:01,585 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 288 flow [2023-01-27 18:11:01,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-01-27 18:11:01,587 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-01-27 18:11:01,587 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 288 flow [2023-01-27 18:11:01,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:01,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:01,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:01,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:11:01,587 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:01,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1835565281, now seen corresponding path program 1 times [2023-01-27 18:11:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46661110] [2023-01-27 18:11:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:01,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46661110] [2023-01-27 18:11:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46661110] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:01,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890130211] [2023-01-27 18:11:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:01,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:01,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:11:01,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:01,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:01,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:11:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:03,109 INFO L130 PetriNetUnfolder]: 7178/10290 cut-off events. [2023-01-27 18:11:03,109 INFO L131 PetriNetUnfolder]: For 28795/29537 co-relation queries the response was YES. [2023-01-27 18:11:03,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37850 conditions, 10290 events. 7178/10290 cut-off events. For 28795/29537 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 56108 event pairs, 2105 based on Foata normal form. 407/10381 useless extension candidates. Maximal degree in co-relation 37825. Up to 6831 conditions per place. [2023-01-27 18:11:03,257 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 56 selfloop transitions, 10 changer transitions 19/93 dead transitions. [2023-01-27 18:11:03,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 670 flow [2023-01-27 18:11:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:11:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:11:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-01-27 18:11:03,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134751773049645 [2023-01-27 18:11:03,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-01-27 18:11:03,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-01-27 18:11:03,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:03,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-01-27 18:11:03,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:03,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:03,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:03,262 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 288 flow. Second operand 6 states and 724 transitions. [2023-01-27 18:11:03,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 670 flow [2023-01-27 18:11:03,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 662 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:03,316 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 344 flow [2023-01-27 18:11:03,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-01-27 18:11:03,318 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-01-27 18:11:03,318 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 344 flow [2023-01-27 18:11:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:03,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:03,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:03,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:11:03,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:03,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -445133995, now seen corresponding path program 2 times [2023-01-27 18:11:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:03,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990929228] [2023-01-27 18:11:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:03,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:03,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990929228] [2023-01-27 18:11:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990929228] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:03,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204017820] [2023-01-27 18:11:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:03,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:03,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-01-27 18:11:03,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:03,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:03,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-01-27 18:11:03,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:05,673 INFO L130 PetriNetUnfolder]: 7640/10899 cut-off events. [2023-01-27 18:11:05,673 INFO L131 PetriNetUnfolder]: For 41127/42400 co-relation queries the response was YES. [2023-01-27 18:11:05,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43528 conditions, 10899 events. 7640/10899 cut-off events. For 41127/42400 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 59604 event pairs, 2163 based on Foata normal form. 551/11119 useless extension candidates. Maximal degree in co-relation 43499. Up to 7086 conditions per place. [2023-01-27 18:11:05,828 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 65 selfloop transitions, 20 changer transitions 35/128 dead transitions. [2023-01-27 18:11:05,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 128 transitions, 1014 flow [2023-01-27 18:11:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:11:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:11:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1050 transitions. [2023-01-27 18:11:05,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2023-01-27 18:11:05,830 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1050 transitions. [2023-01-27 18:11:05,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1050 transitions. [2023-01-27 18:11:05,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:05,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1050 transitions. [2023-01-27 18:11:05,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.66666666666667) internal successors, (1050), 9 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:05,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:05,836 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:05,836 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 344 flow. Second operand 9 states and 1050 transitions. [2023-01-27 18:11:05,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 128 transitions, 1014 flow [2023-01-27 18:11:05,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 992 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-27 18:11:05,923 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 526 flow [2023-01-27 18:11:05,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=526, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-01-27 18:11:05,924 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-01-27 18:11:05,924 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 526 flow [2023-01-27 18:11:05,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:05,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:05,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:05,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:11:05,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:05,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1168469844, now seen corresponding path program 1 times [2023-01-27 18:11:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762074880] [2023-01-27 18:11:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:06,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762074880] [2023-01-27 18:11:06,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762074880] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:06,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:06,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:06,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656950840] [2023-01-27 18:11:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:11:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:11:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:11:06,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-01-27 18:11:06,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 526 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:06,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:06,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-01-27 18:11:06,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:08,420 INFO L130 PetriNetUnfolder]: 7381/10512 cut-off events. [2023-01-27 18:11:08,421 INFO L131 PetriNetUnfolder]: For 72624/74294 co-relation queries the response was YES. [2023-01-27 18:11:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50033 conditions, 10512 events. 7381/10512 cut-off events. For 72624/74294 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 56964 event pairs, 1833 based on Foata normal form. 449/10622 useless extension candidates. Maximal degree in co-relation 49999. Up to 7320 conditions per place. [2023-01-27 18:11:08,701 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 68 selfloop transitions, 12 changer transitions 21/109 dead transitions. [2023-01-27 18:11:08,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 1011 flow [2023-01-27 18:11:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-01-27 18:11:08,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2023-01-27 18:11:08,710 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-01-27 18:11:08,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-01-27 18:11:08,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:08,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-01-27 18:11:08,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:08,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:08,715 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:08,715 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 526 flow. Second operand 7 states and 810 transitions. [2023-01-27 18:11:08,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 1011 flow [2023-01-27 18:11:08,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 946 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:08,924 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 546 flow [2023-01-27 18:11:08,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-01-27 18:11:08,926 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-01-27 18:11:08,926 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 546 flow [2023-01-27 18:11:08,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:08,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:08,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:08,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:11:08,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:08,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash 428915926, now seen corresponding path program 1 times [2023-01-27 18:11:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107362276] [2023-01-27 18:11:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107362276] [2023-01-27 18:11:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107362276] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:10,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:10,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:11:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857134328] [2023-01-27 18:11:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:10,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:11:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:11:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:11:10,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:11:10,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:10,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:10,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:11:10,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:12,517 INFO L130 PetriNetUnfolder]: 10111/13768 cut-off events. [2023-01-27 18:11:12,517 INFO L131 PetriNetUnfolder]: For 74550/74550 co-relation queries the response was YES. [2023-01-27 18:11:12,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62204 conditions, 13768 events. 10111/13768 cut-off events. For 74550/74550 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 66711 event pairs, 1083 based on Foata normal form. 264/14032 useless extension candidates. Maximal degree in co-relation 62168. Up to 8267 conditions per place. [2023-01-27 18:11:12,630 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 108 selfloop transitions, 50 changer transitions 35/193 dead transitions. [2023-01-27 18:11:12,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 193 transitions, 1760 flow [2023-01-27 18:11:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:11:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:11:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1209 transitions. [2023-01-27 18:11:12,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46769825918762087 [2023-01-27 18:11:12,641 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1209 transitions. [2023-01-27 18:11:12,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1209 transitions. [2023-01-27 18:11:12,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:12,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1209 transitions. [2023-01-27 18:11:12,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 109.9090909090909) internal successors, (1209), 11 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:12,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 235.0) internal successors, (2820), 12 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:12,670 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 235.0) internal successors, (2820), 12 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:12,670 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 546 flow. Second operand 11 states and 1209 transitions. [2023-01-27 18:11:12,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 193 transitions, 1760 flow [2023-01-27 18:11:12,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 193 transitions, 1717 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:12,950 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 1003 flow [2023-01-27 18:11:12,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1003, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2023-01-27 18:11:12,951 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-01-27 18:11:12,954 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 1003 flow [2023-01-27 18:11:12,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:12,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:12,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:12,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:11:12,965 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:12,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1369540629, now seen corresponding path program 1 times [2023-01-27 18:11:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818526650] [2023-01-27 18:11:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:13,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:13,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818526650] [2023-01-27 18:11:13,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818526650] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:13,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:13,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:11:13,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274848667] [2023-01-27 18:11:13,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:13,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:13,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:13,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:13,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:11:13,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 1003 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:13,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:13,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:11:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:14,346 INFO L130 PetriNetUnfolder]: 4642/6795 cut-off events. [2023-01-27 18:11:14,346 INFO L131 PetriNetUnfolder]: For 68971/69914 co-relation queries the response was YES. [2023-01-27 18:11:14,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37250 conditions, 6795 events. 4642/6795 cut-off events. For 68971/69914 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36579 event pairs, 1418 based on Foata normal form. 462/6933 useless extension candidates. Maximal degree in co-relation 37208. Up to 5168 conditions per place. [2023-01-27 18:11:14,402 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 115 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2023-01-27 18:11:14,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 139 transitions, 1796 flow [2023-01-27 18:11:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-01-27 18:11:14,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219858156028369 [2023-01-27 18:11:14,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-01-27 18:11:14,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-01-27 18:11:14,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:14,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-01-27 18:11:14,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:14,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:14,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:14,434 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 1003 flow. Second operand 3 states and 368 transitions. [2023-01-27 18:11:14,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 139 transitions, 1796 flow [2023-01-27 18:11:14,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 1708 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:14,586 INFO L231 Difference]: Finished difference. Result has 81 places, 94 transitions, 984 flow [2023-01-27 18:11:14,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=81, PETRI_TRANSITIONS=94} [2023-01-27 18:11:14,587 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-01-27 18:11:14,588 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 984 flow [2023-01-27 18:11:14,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:14,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:14,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:14,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:11:14,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:14,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -455219962, now seen corresponding path program 1 times [2023-01-27 18:11:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429031254] [2023-01-27 18:11:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429031254] [2023-01-27 18:11:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429031254] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262753394] [2023-01-27 18:11:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:14,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:11:14,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 984 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:14,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:14,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:11:14,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:15,365 INFO L130 PetriNetUnfolder]: 2275/3541 cut-off events. [2023-01-27 18:11:15,365 INFO L131 PetriNetUnfolder]: For 29051/29467 co-relation queries the response was YES. [2023-01-27 18:11:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19168 conditions, 3541 events. 2275/3541 cut-off events. For 29051/29467 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18525 event pairs, 482 based on Foata normal form. 375/3771 useless extension candidates. Maximal degree in co-relation 19127. Up to 1543 conditions per place. [2023-01-27 18:11:15,387 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 139 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2023-01-27 18:11:15,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 2061 flow [2023-01-27 18:11:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:11:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:11:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-01-27 18:11:15,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2023-01-27 18:11:15,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-01-27 18:11:15,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-01-27 18:11:15,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:15,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-01-27 18:11:15,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:15,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:15,410 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:15,410 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 984 flow. Second operand 4 states and 492 transitions. [2023-01-27 18:11:15,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 2061 flow [2023-01-27 18:11:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 167 transitions, 1987 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-01-27 18:11:15,466 INFO L231 Difference]: Finished difference. Result has 79 places, 92 transitions, 920 flow [2023-01-27 18:11:15,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=79, PETRI_TRANSITIONS=92} [2023-01-27 18:11:15,466 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-01-27 18:11:15,466 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 92 transitions, 920 flow [2023-01-27 18:11:15,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:15,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:15,467 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] [2023-01-27 18:11:15,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:11:15,467 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:15,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1042853925, now seen corresponding path program 1 times [2023-01-27 18:11:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722496492] [2023-01-27 18:11:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:15,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722496492] [2023-01-27 18:11:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722496492] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:15,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:15,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867184721] [2023-01-27 18:11:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:15,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:15,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:15,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:15,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:11:15,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 92 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:15,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:15,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:11:15,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:16,269 INFO L130 PetriNetUnfolder]: 1570/2445 cut-off events. [2023-01-27 18:11:16,269 INFO L131 PetriNetUnfolder]: For 18663/18919 co-relation queries the response was YES. [2023-01-27 18:11:16,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13249 conditions, 2445 events. 1570/2445 cut-off events. For 18663/18919 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12495 event pairs, 308 based on Foata normal form. 204/2521 useless extension candidates. Maximal degree in co-relation 13210. Up to 946 conditions per place. [2023-01-27 18:11:16,302 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 137 selfloop transitions, 13 changer transitions 0/169 dead transitions. [2023-01-27 18:11:16,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 169 transitions, 2017 flow [2023-01-27 18:11:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-01-27 18:11:16,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225531914893617 [2023-01-27 18:11:16,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-01-27 18:11:16,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-01-27 18:11:16,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:16,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-01-27 18:11:16,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:16,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:16,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:16,307 INFO L175 Difference]: Start difference. First operand has 79 places, 92 transitions, 920 flow. Second operand 5 states and 614 transitions. [2023-01-27 18:11:16,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 169 transitions, 2017 flow [2023-01-27 18:11:16,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 1896 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-01-27 18:11:16,353 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 841 flow [2023-01-27 18:11:16,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=841, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2023-01-27 18:11:16,368 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-01-27 18:11:16,369 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 841 flow [2023-01-27 18:11:16,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:16,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:16,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:16,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:11:16,369 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:16,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash -513631286, now seen corresponding path program 1 times [2023-01-27 18:11:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:16,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140780421] [2023-01-27 18:11:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140780421] [2023-01-27 18:11:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140780421] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:17,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:17,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264391214] [2023-01-27 18:11:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:17,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:17,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-27 18:11:17,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 841 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:17,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:17,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-27 18:11:17,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:18,862 INFO L130 PetriNetUnfolder]: 3181/4715 cut-off events. [2023-01-27 18:11:18,862 INFO L131 PetriNetUnfolder]: For 27544/27544 co-relation queries the response was YES. [2023-01-27 18:11:18,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24896 conditions, 4715 events. 3181/4715 cut-off events. For 27544/27544 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 22537 event pairs, 371 based on Foata normal form. 14/4729 useless extension candidates. Maximal degree in co-relation 24858. Up to 2504 conditions per place. [2023-01-27 18:11:18,903 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 144 selfloop transitions, 73 changer transitions 76/293 dead transitions. [2023-01-27 18:11:18,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 293 transitions, 3399 flow [2023-01-27 18:11:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2023-01-27 18:11:18,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717325227963526 [2023-01-27 18:11:18,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 776 transitions. [2023-01-27 18:11:18,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 776 transitions. [2023-01-27 18:11:18,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:18,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 776 transitions. [2023-01-27 18:11:18,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:18,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:18,928 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:18,928 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 841 flow. Second operand 7 states and 776 transitions. [2023-01-27 18:11:18,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 293 transitions, 3399 flow [2023-01-27 18:11:19,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 293 transitions, 3279 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-01-27 18:11:19,031 INFO L231 Difference]: Finished difference. Result has 87 places, 132 transitions, 1589 flow [2023-01-27 18:11:19,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1589, PETRI_PLACES=87, PETRI_TRANSITIONS=132} [2023-01-27 18:11:19,032 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-01-27 18:11:19,032 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 132 transitions, 1589 flow [2023-01-27 18:11:19,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:19,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:19,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:19,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:11:19,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:19,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash -904028653, now seen corresponding path program 1 times [2023-01-27 18:11:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:19,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919074250] [2023-01-27 18:11:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919074250] [2023-01-27 18:11:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919074250] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413814041] [2023-01-27 18:11:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:20,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:20,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:20,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:11:20,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 132 transitions, 1589 flow. Second operand has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 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-27 18:11:20,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:20,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:11:20,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:21,259 INFO L130 PetriNetUnfolder]: 3890/5862 cut-off events. [2023-01-27 18:11:21,260 INFO L131 PetriNetUnfolder]: For 38097/38097 co-relation queries the response was YES. [2023-01-27 18:11:21,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33392 conditions, 5862 events. 3890/5862 cut-off events. For 38097/38097 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 29694 event pairs, 553 based on Foata normal form. 16/5878 useless extension candidates. Maximal degree in co-relation 33349. Up to 3051 conditions per place. [2023-01-27 18:11:21,307 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 112 selfloop transitions, 19 changer transitions 64/195 dead transitions. [2023-01-27 18:11:21,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 195 transitions, 2532 flow [2023-01-27 18:11:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-01-27 18:11:21,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714893617021277 [2023-01-27 18:11:21,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-01-27 18:11:21,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-01-27 18:11:21,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:21,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-01-27 18:11:21,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:21,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:21,334 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:21,334 INFO L175 Difference]: Start difference. First operand has 87 places, 132 transitions, 1589 flow. Second operand 5 states and 554 transitions. [2023-01-27 18:11:21,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 195 transitions, 2532 flow [2023-01-27 18:11:21,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 195 transitions, 2506 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:21,545 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 1073 flow [2023-01-27 18:11:21,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1073, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2023-01-27 18:11:21,547 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-01-27 18:11:21,547 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 1073 flow [2023-01-27 18:11:21,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 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-27 18:11:21,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:21,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:21,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:11:21,547 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:21,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1524845454, now seen corresponding path program 2 times [2023-01-27 18:11:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:21,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72292603] [2023-01-27 18:11:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72292603] [2023-01-27 18:11:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72292603] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896584418] [2023-01-27 18:11:21,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:21,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:21,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:21,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:21,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:11:21,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 1073 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:21,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:21,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:11:21,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:23,117 INFO L130 PetriNetUnfolder]: 3161/5248 cut-off events. [2023-01-27 18:11:23,118 INFO L131 PetriNetUnfolder]: For 42930/43291 co-relation queries the response was YES. [2023-01-27 18:11:23,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29880 conditions, 5248 events. 3161/5248 cut-off events. For 42930/43291 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31949 event pairs, 553 based on Foata normal form. 182/5352 useless extension candidates. Maximal degree in co-relation 29833. Up to 2604 conditions per place. [2023-01-27 18:11:23,152 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 129 selfloop transitions, 2 changer transitions 57/200 dead transitions. [2023-01-27 18:11:23,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 200 transitions, 2583 flow [2023-01-27 18:11:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-01-27 18:11:23,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208510638297872 [2023-01-27 18:11:23,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-01-27 18:11:23,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-01-27 18:11:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:23,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-01-27 18:11:23,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:23,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:23,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:23,170 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 1073 flow. Second operand 5 states and 612 transitions. [2023-01-27 18:11:23,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 200 transitions, 2583 flow [2023-01-27 18:11:23,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 200 transitions, 2491 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-01-27 18:11:23,314 INFO L231 Difference]: Finished difference. Result has 95 places, 93 transitions, 1002 flow [2023-01-27 18:11:23,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1002, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2023-01-27 18:11:23,321 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2023-01-27 18:11:23,321 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 1002 flow [2023-01-27 18:11:23,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:23,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:23,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:23,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:11:23,322 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:23,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash 917104062, now seen corresponding path program 3 times [2023-01-27 18:11:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258258689] [2023-01-27 18:11:23,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258258689] [2023-01-27 18:11:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258258689] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:24,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:11:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223762872] [2023-01-27 18:11:24,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:24,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:11:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:11:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:11:24,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-01-27 18:11:24,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 1002 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:24,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:24,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-01-27 18:11:24,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:25,170 INFO L130 PetriNetUnfolder]: 3106/5168 cut-off events. [2023-01-27 18:11:25,171 INFO L131 PetriNetUnfolder]: For 41393/41842 co-relation queries the response was YES. [2023-01-27 18:11:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29298 conditions, 5168 events. 3106/5168 cut-off events. For 41393/41842 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 31154 event pairs, 677 based on Foata normal form. 133/5171 useless extension candidates. Maximal degree in co-relation 29250. Up to 3946 conditions per place. [2023-01-27 18:11:25,238 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 94 selfloop transitions, 12 changer transitions 9/127 dead transitions. [2023-01-27 18:11:25,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1469 flow [2023-01-27 18:11:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:11:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:11:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2023-01-27 18:11:25,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48014184397163123 [2023-01-27 18:11:25,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 677 transitions. [2023-01-27 18:11:25,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 677 transitions. [2023-01-27 18:11:25,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:25,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 677 transitions. [2023-01-27 18:11:25,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:25,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:25,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:25,244 INFO L175 Difference]: Start difference. First operand has 95 places, 93 transitions, 1002 flow. Second operand 6 states and 677 transitions. [2023-01-27 18:11:25,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1469 flow [2023-01-27 18:11:25,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 1461 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:25,427 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 1034 flow [2023-01-27 18:11:25,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1034, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2023-01-27 18:11:25,428 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2023-01-27 18:11:25,428 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 1034 flow [2023-01-27 18:11:25,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:25,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:25,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:11:25,428 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:25,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -289034443, now seen corresponding path program 2 times [2023-01-27 18:11:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693936636] [2023-01-27 18:11:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:25,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693936636] [2023-01-27 18:11:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693936636] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358803065] [2023-01-27 18:11:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:25,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:25,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-27 18:11:25,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 1034 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-27 18:11:25,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:25,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-27 18:11:25,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:26,932 INFO L130 PetriNetUnfolder]: 2718/4421 cut-off events. [2023-01-27 18:11:26,932 INFO L131 PetriNetUnfolder]: For 38313/38651 co-relation queries the response was YES. [2023-01-27 18:11:26,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25376 conditions, 4421 events. 2718/4421 cut-off events. For 38313/38651 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26924 event pairs, 332 based on Foata normal form. 260/4582 useless extension candidates. Maximal degree in co-relation 25331. Up to 1595 conditions per place. [2023-01-27 18:11:26,972 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 47 selfloop transitions, 17 changer transitions 99/169 dead transitions. [2023-01-27 18:11:26,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 169 transitions, 2193 flow [2023-01-27 18:11:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:11:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:11:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 723 transitions. [2023-01-27 18:11:26,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127659574468085 [2023-01-27 18:11:26,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 723 transitions. [2023-01-27 18:11:26,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 723 transitions. [2023-01-27 18:11:26,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:26,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 723 transitions. [2023-01-27 18:11:26,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:27,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:27,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:27,004 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 1034 flow. Second operand 6 states and 723 transitions. [2023-01-27 18:11:27,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 169 transitions, 2193 flow [2023-01-27 18:11:27,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 169 transitions, 2041 flow, removed 51 selfloop flow, removed 8 redundant places. [2023-01-27 18:11:27,297 INFO L231 Difference]: Finished difference. Result has 96 places, 48 transitions, 435 flow [2023-01-27 18:11:27,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=96, PETRI_TRANSITIONS=48} [2023-01-27 18:11:27,298 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2023-01-27 18:11:27,298 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 48 transitions, 435 flow [2023-01-27 18:11:27,298 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-27 18:11:27,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:27,298 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, 1] [2023-01-27 18:11:27,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:11:27,298 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:27,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1828544641, now seen corresponding path program 1 times [2023-01-27 18:11:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162275640] [2023-01-27 18:11:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:27,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:11:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:27,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:11:27,686 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:11:27,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:11:27,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:11:27,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:11:27,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:11:27,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:11:27,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:11:27,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:11:27,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:11:27,691 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:27,696 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:11:27,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:11:27,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:11:27 BasicIcfg [2023-01-27 18:11:27,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:11:27,816 INFO L158 Benchmark]: Toolchain (without parser) took 49961.76ms. Allocated memory was 413.1MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 359.0MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 526.5MB. Max. memory is 16.0GB. [2023-01-27 18:11:27,816 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 308.3MB. Free memory is still 254.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:11:27,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 952.37ms. Allocated memory is still 413.1MB. Free memory was 358.7MB in the beginning and 335.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:27,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.93ms. Allocated memory is still 413.1MB. Free memory was 335.3MB in the beginning and 332.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:27,817 INFO L158 Benchmark]: Boogie Preprocessor took 92.93ms. Allocated memory is still 413.1MB. Free memory was 332.5MB in the beginning and 330.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:27,817 INFO L158 Benchmark]: RCFGBuilder took 1180.54ms. Allocated memory is still 413.1MB. Free memory was 330.3MB in the beginning and 358.2MB in the end (delta: -27.8MB). Peak memory consumption was 27.8MB. Max. memory is 16.0GB. [2023-01-27 18:11:27,817 INFO L158 Benchmark]: TraceAbstraction took 47580.60ms. Allocated memory was 413.1MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 357.3MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 523.8MB. Max. memory is 16.0GB. [2023-01-27 18:11:27,818 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.11ms. Allocated memory is still 308.3MB. Free memory is still 254.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 952.37ms. Allocated memory is still 413.1MB. Free memory was 358.7MB in the beginning and 335.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 139.93ms. Allocated memory is still 413.1MB. Free memory was 335.3MB in the beginning and 332.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 92.93ms. Allocated memory is still 413.1MB. Free memory was 332.5MB in the beginning and 330.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1180.54ms. Allocated memory is still 413.1MB. Free memory was 330.3MB in the beginning and 358.2MB in the end (delta: -27.8MB). Peak memory consumption was 27.8MB. Max. memory is 16.0GB. * TraceAbstraction took 47580.60ms. Allocated memory was 413.1MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 357.3MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 523.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3282, independent: 3048, independent conditional: 0, independent unconditional: 3048, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1531, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1531, unknown conditional: 0, unknown unconditional: 1531] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-4, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-3, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-2, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] 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_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 847]: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 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: 47.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2320 IncrementalHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 67 mSDtfsCounter, 2320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1589occurred in iteration=13, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 2631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:11:27,853 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...