/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/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:18:15,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:18:15,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:18:15,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:18:15,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:18:15,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:18:15,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:18:15,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:18:15,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:18:15,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:18:15,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:18:15,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:18:15,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:18:15,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:18:15,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:18:15,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:18:15,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:18:15,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:18:15,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:18:15,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:18:15,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:18:15,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:18:15,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:18:15,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:18:15,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:18:15,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:18:15,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:18:15,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:18:15,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:18:15,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:18:15,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:18:15,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:18:15,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:18:15,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:18:15,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:18:15,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:18:15,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:18:15,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:18:15,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:18:15,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:18:15,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:18:15,401 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:18:15,421 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:18:15,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:18:15,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:18:15,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:18:15,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:18:15,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:18:15,423 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:18:15,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:18:15,423 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:18:15,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:18:15,424 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:18:15,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:18:15,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:18:15,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:18:15,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:18:15,426 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:18:15,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:18:15,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:18:15,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:18:15,631 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:18:15,632 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:18:15,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-01-27 18:18:16,536 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:18:16,803 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:18:16,804 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-01-27 18:18:16,811 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a269201/4406bfcab2eb4c7a8b93b4dc89b5f950/FLAGed60827ef [2023-01-27 18:18:16,822 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a269201/4406bfcab2eb4c7a8b93b4dc89b5f950 [2023-01-27 18:18:16,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:18:16,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:18:16,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:18:16,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:18:16,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:18:16,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:18:16" (1/1) ... [2023-01-27 18:18:16,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50992ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:16, skipping insertion in model container [2023-01-27 18:18:16,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:18:16" (1/1) ... [2023-01-27 18:18:16,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:18:16,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:18:16,986 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-01-27 18:18:17,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:18:17,152 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:18:17,159 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-01-27 18:18:17,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:18:17,212 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:18:17,212 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:18:17,217 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:18:17,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17 WrapperNode [2023-01-27 18:18:17,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:18:17,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:18:17,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:18:17,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:18:17,223 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:18:17" (1/1) ... [2023-01-27 18:18:17,250 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:18:17" (1/1) ... [2023-01-27 18:18:17,275 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-01-27 18:18:17,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:18:17,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:18:17,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:18:17,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:18:17,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:18:17,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:18:17,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:18:17,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:18:17,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (1/1) ... [2023-01-27 18:18:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:18:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:18:17,354 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:18:17,370 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:18:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:18:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:18:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:18:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:18:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:18:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:18:17,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:18:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:18:17,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:18:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:18:17,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:18:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:18:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:18:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:18:17,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:18:17,386 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:18:17,491 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:18:17,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:18:17,753 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:18:17,902 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:18:17,903 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:18:17,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:18:17 BoogieIcfgContainer [2023-01-27 18:18:17,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:18:17,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:18:17,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:18:17,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:18:17,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:18:16" (1/3) ... [2023-01-27 18:18:17,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4fba38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:18:17, skipping insertion in model container [2023-01-27 18:18:17,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:17" (2/3) ... [2023-01-27 18:18:17,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4fba38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:18:17, skipping insertion in model container [2023-01-27 18:18:17,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:18:17" (3/3) ... [2023-01-27 18:18:17,911 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-01-27 18:18:17,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:18:17,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:18:17,933 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:18:17,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:18:17,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:18:18,041 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:18:18,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:18:18,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:18:18,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:18:18,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-01-27 18:18:18,054 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:18:18,063 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:18:18,065 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:18:18,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-01-27 18:18:18,089 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:18:18,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:18:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:18:18,091 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-01-27 18:18:20,873 INFO L134 LiptonReduction]: Checked pairs total: 4829 [2023-01-27 18:18:20,873 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-01-27 18:18:20,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:18:20,887 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;@669c7c33, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:18:20,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:18:20,890 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:18:20,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:18:20,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:20,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:18:20,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:20,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 442870472, now seen corresponding path program 1 times [2023-01-27 18:18:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393393617] [2023-01-27 18:18:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:21,161 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:18:21,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393393617] [2023-01-27 18:18:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393393617] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:18:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763340228] [2023-01-27 18:18:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:21,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:18:21,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:18:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:18:21,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 201 [2023-01-27 18:18:21,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:18:21,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:21,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 201 [2023-01-27 18:18:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:21,398 INFO L130 PetriNetUnfolder]: 999/1620 cut-off events. [2023-01-27 18:18:21,399 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-27 18:18:21,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 1620 events. 999/1620 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8311 event pairs, 165 based on Foata normal form. 64/1552 useless extension candidates. Maximal degree in co-relation 3144. Up to 1195 conditions per place. [2023-01-27 18:18:21,406 INFO L137 encePairwiseOnDemand]: 197/201 looper letters, 29 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-01-27 18:18:21,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2023-01-27 18:18:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:18:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:18:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-01-27 18:18:21,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-01-27 18:18:21,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-01-27 18:18:21,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-01-27 18:18:21,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:21,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-01-27 18:18:21,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states 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:18:21,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:18:21,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:18:21,433 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 323 transitions. [2023-01-27 18:18:21,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2023-01-27 18:18:21,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:18:21,437 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-27 18:18:21,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-27 18:18:21,442 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:18:21,442 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-27 18:18:21,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:18:21,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:21,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:21,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:18:21,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:21,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1811307044, now seen corresponding path program 1 times [2023-01-27 18:18:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521291131] [2023-01-27 18:18:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:21,658 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:18:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:21,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521291131] [2023-01-27 18:18:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521291131] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:18:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645893164] [2023-01-27 18:18:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:21,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:18:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:18:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:18:21,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-01-27 18:18:21,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:21,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:21,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-01-27 18:18:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:21,851 INFO L130 PetriNetUnfolder]: 773/1237 cut-off events. [2023-01-27 18:18:21,852 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-01-27 18:18:21,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1237 events. 773/1237 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5809 event pairs, 406 based on Foata normal form. 64/1300 useless extension candidates. Maximal degree in co-relation 2565. Up to 1008 conditions per place. [2023-01-27 18:18:21,856 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 27 selfloop transitions, 3 changer transitions 15/47 dead transitions. [2023-01-27 18:18:21,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 204 flow [2023-01-27 18:18:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-27 18:18:21,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-01-27 18:18:21,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-27 18:18:21,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-27 18:18:21,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:21,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-27 18:18:21,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:18:21,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:21,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:21,861 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 487 transitions. [2023-01-27 18:18:21,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 204 flow [2023-01-27 18:18:21,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:18:21,862 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 75 flow [2023-01-27 18:18:21,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-01-27 18:18:21,863 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-27 18:18:21,863 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 75 flow [2023-01-27 18:18:21,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:21,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:21,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:21,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:18:21,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:21,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash 315936094, now seen corresponding path program 1 times [2023-01-27 18:18:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:21,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391330060] [2023-01-27 18:18:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:22,059 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:18:22,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:22,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391330060] [2023-01-27 18:18:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391330060] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:22,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:22,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154329340] [2023-01-27 18:18:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:22,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:22,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:22,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-01-27 18:18:22,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:22,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:22,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-01-27 18:18:22,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:22,219 INFO L130 PetriNetUnfolder]: 699/1144 cut-off events. [2023-01-27 18:18:22,219 INFO L131 PetriNetUnfolder]: For 459/459 co-relation queries the response was YES. [2023-01-27 18:18:22,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1144 events. 699/1144 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5337 event pairs, 175 based on Foata normal form. 48/1188 useless extension candidates. Maximal degree in co-relation 2696. Up to 761 conditions per place. [2023-01-27 18:18:22,225 INFO L137 encePairwiseOnDemand]: 197/201 looper letters, 25 selfloop transitions, 3 changer transitions 14/44 dead transitions. [2023-01-27 18:18:22,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 207 flow [2023-01-27 18:18:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-01-27 18:18:22,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48059701492537316 [2023-01-27 18:18:22,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-01-27 18:18:22,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-01-27 18:18:22,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:22,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-01-27 18:18:22,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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:18:22,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:22,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:22,230 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 75 flow. Second operand 5 states and 483 transitions. [2023-01-27 18:18:22,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 207 flow [2023-01-27 18:18:22,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 198 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-27 18:18:22,235 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 83 flow [2023-01-27 18:18:22,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-01-27 18:18:22,236 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-27 18:18:22,238 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 83 flow [2023-01-27 18:18:22,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:22,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:22,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:22,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:18:22,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:22,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash 315937055, now seen corresponding path program 1 times [2023-01-27 18:18:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:22,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738233427] [2023-01-27 18:18:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:22,409 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:18:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738233427] [2023-01-27 18:18:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738233427] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797027374] [2023-01-27 18:18:22,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:22,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:22,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:22,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:22,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-01-27 18:18:22,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:22,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:22,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-01-27 18:18:22,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:22,585 INFO L130 PetriNetUnfolder]: 641/1038 cut-off events. [2023-01-27 18:18:22,585 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2023-01-27 18:18:22,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 1038 events. 641/1038 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4849 event pairs, 231 based on Foata normal form. 48/1082 useless extension candidates. Maximal degree in co-relation 2534. Up to 757 conditions per place. [2023-01-27 18:18:22,589 INFO L137 encePairwiseOnDemand]: 197/201 looper letters, 29 selfloop transitions, 3 changer transitions 14/48 dead transitions. [2023-01-27 18:18:22,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 237 flow [2023-01-27 18:18:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-27 18:18:22,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-01-27 18:18:22,591 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-27 18:18:22,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-27 18:18:22,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:22,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-27 18:18:22,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:18:22,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:22,600 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:22,600 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 83 flow. Second operand 5 states and 487 transitions. [2023-01-27 18:18:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 237 flow [2023-01-27 18:18:22,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 223 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-27 18:18:22,602 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 86 flow [2023-01-27 18:18:22,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2023-01-27 18:18:22,603 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-27 18:18:22,603 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 86 flow [2023-01-27 18:18:22,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:22,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:22,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:22,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:18:22,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:22,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1204077861, now seen corresponding path program 1 times [2023-01-27 18:18:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339573771] [2023-01-27 18:18:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:22,730 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:18:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339573771] [2023-01-27 18:18:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339573771] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853713186] [2023-01-27 18:18:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:22,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:22,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:22,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:22,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-01-27 18:18:22,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:18:22,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:22,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-01-27 18:18:22,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:23,081 INFO L130 PetriNetUnfolder]: 1155/1815 cut-off events. [2023-01-27 18:18:23,081 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2023-01-27 18:18:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1815 events. 1155/1815 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9020 event pairs, 226 based on Foata normal form. 75/1882 useless extension candidates. Maximal degree in co-relation 4452. Up to 721 conditions per place. [2023-01-27 18:18:23,088 INFO L137 encePairwiseOnDemand]: 194/201 looper letters, 46 selfloop transitions, 11 changer transitions 26/84 dead transitions. [2023-01-27 18:18:23,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 84 transitions, 427 flow [2023-01-27 18:18:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:18:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:18:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2023-01-27 18:18:23,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748479823106689 [2023-01-27 18:18:23,107 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2023-01-27 18:18:23,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2023-01-27 18:18:23,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:23,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2023-01-27 18:18:23,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states 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:18:23,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:18:23,111 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:18:23,111 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 86 flow. Second operand 9 states and 859 transitions. [2023-01-27 18:18:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 84 transitions, 427 flow [2023-01-27 18:18:23,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 84 transitions, 403 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-01-27 18:18:23,117 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 169 flow [2023-01-27 18:18:23,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-01-27 18:18:23,118 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-27 18:18:23,118 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 169 flow [2023-01-27 18:18:23,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:18:23,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:23,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:23,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:18:23,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:23,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash -25665789, now seen corresponding path program 2 times [2023-01-27 18:18:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973685769] [2023-01-27 18:18:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:23,316 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:18:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973685769] [2023-01-27 18:18:23,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973685769] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:23,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:18:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558071277] [2023-01-27 18:18:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:18:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:18:23,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:18:23,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-01-27 18:18:23,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:23,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:23,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-01-27 18:18:23,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:23,564 INFO L130 PetriNetUnfolder]: 1177/1858 cut-off events. [2023-01-27 18:18:23,564 INFO L131 PetriNetUnfolder]: For 2786/2786 co-relation queries the response was YES. [2023-01-27 18:18:23,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 1858 events. 1177/1858 cut-off events. For 2786/2786 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9261 event pairs, 322 based on Foata normal form. 45/1899 useless extension candidates. Maximal degree in co-relation 5556. Up to 729 conditions per place. [2023-01-27 18:18:23,572 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 31 selfloop transitions, 5 changer transitions 24/61 dead transitions. [2023-01-27 18:18:23,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 406 flow [2023-01-27 18:18:23,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:18:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:18:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-01-27 18:18:23,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734660033167496 [2023-01-27 18:18:23,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-01-27 18:18:23,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-01-27 18:18:23,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:23,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-01-27 18:18:23,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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:18:23,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:18:23,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:18:23,577 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 169 flow. Second operand 6 states and 571 transitions. [2023-01-27 18:18:23,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 406 flow [2023-01-27 18:18:23,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 390 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-27 18:18:23,582 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 142 flow [2023-01-27 18:18:23,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2023-01-27 18:18:23,583 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-27 18:18:23,583 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 142 flow [2023-01-27 18:18:23,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:23,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:23,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:23,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:18:23,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:23,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1712907669, now seen corresponding path program 1 times [2023-01-27 18:18:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:23,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365541133] [2023-01-27 18:18:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:23,686 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:18:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365541133] [2023-01-27 18:18:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365541133] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248457382] [2023-01-27 18:18:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:23,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:23,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-01-27 18:18:23,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:18:23,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:23,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-01-27 18:18:23,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:23,856 INFO L130 PetriNetUnfolder]: 755/1176 cut-off events. [2023-01-27 18:18:23,857 INFO L131 PetriNetUnfolder]: For 2518/2522 co-relation queries the response was YES. [2023-01-27 18:18:23,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3762 conditions, 1176 events. 755/1176 cut-off events. For 2518/2522 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4646 event pairs, 209 based on Foata normal form. 36/1207 useless extension candidates. Maximal degree in co-relation 3738. Up to 406 conditions per place. [2023-01-27 18:18:23,862 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 27 selfloop transitions, 3 changer transitions 22/53 dead transitions. [2023-01-27 18:18:23,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 357 flow [2023-01-27 18:18:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:18:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:18:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2023-01-27 18:18:23,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842454394693201 [2023-01-27 18:18:23,863 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 584 transitions. [2023-01-27 18:18:23,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 584 transitions. [2023-01-27 18:18:23,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:23,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 584 transitions. [2023-01-27 18:18:23,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:23,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:18:23,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:18:23,866 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 142 flow. Second operand 6 states and 584 transitions. [2023-01-27 18:18:23,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 357 flow [2023-01-27 18:18:23,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 320 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-01-27 18:18:23,870 INFO L231 Difference]: Finished difference. Result has 48 places, 21 transitions, 106 flow [2023-01-27 18:18:23,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=21} [2023-01-27 18:18:23,871 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-27 18:18:23,871 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 21 transitions, 106 flow [2023-01-27 18:18:23,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:18:23,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:23,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:23,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:18:23,872 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:23,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash -747497523, now seen corresponding path program 1 times [2023-01-27 18:18:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:23,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277012263] [2023-01-27 18:18:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:23,978 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:18:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277012263] [2023-01-27 18:18:23,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277012263] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:23,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:18:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417758281] [2023-01-27 18:18:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:18:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:23,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:18:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:18:23,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-01-27 18:18:23,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 21 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:18:23,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:23,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-01-27 18:18:23,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:24,033 INFO L130 PetriNetUnfolder]: 188/331 cut-off events. [2023-01-27 18:18:24,033 INFO L131 PetriNetUnfolder]: For 756/757 co-relation queries the response was YES. [2023-01-27 18:18:24,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 331 events. 188/331 cut-off events. For 756/757 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1120 event pairs, 49 based on Foata normal form. 15/345 useless extension candidates. Maximal degree in co-relation 1066. Up to 290 conditions per place. [2023-01-27 18:18:24,035 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 25 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2023-01-27 18:18:24,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 206 flow [2023-01-27 18:18:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:18:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:18:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-01-27 18:18:24,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024875621890548 [2023-01-27 18:18:24,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-01-27 18:18:24,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-01-27 18:18:24,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:24,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-01-27 18:18:24,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:24,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:18:24,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:18:24,038 INFO L175 Difference]: Start difference. First operand has 48 places, 21 transitions, 106 flow. Second operand 3 states and 303 transitions. [2023-01-27 18:18:24,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 206 flow [2023-01-27 18:18:24,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 159 flow, removed 10 selfloop flow, removed 12 redundant places. [2023-01-27 18:18:24,039 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 96 flow [2023-01-27 18:18:24,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-01-27 18:18:24,040 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-27 18:18:24,040 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 96 flow [2023-01-27 18:18:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:18:24,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:24,040 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:18:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:18:24,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:24,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -20499012, now seen corresponding path program 1 times [2023-01-27 18:18:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319129743] [2023-01-27 18:18:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:24,184 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:18:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319129743] [2023-01-27 18:18:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319129743] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:24,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412688028] [2023-01-27 18:18:24,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:24,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:18:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:18:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:18:24,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-01-27 18:18:24,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:18:24,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:24,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-01-27 18:18:24,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:24,244 INFO L130 PetriNetUnfolder]: 74/159 cut-off events. [2023-01-27 18:18:24,244 INFO L131 PetriNetUnfolder]: For 104/105 co-relation queries the response was YES. [2023-01-27 18:18:24,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 159 events. 74/159 cut-off events. For 104/105 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 427 event pairs, 18 based on Foata normal form. 17/175 useless extension candidates. Maximal degree in co-relation 482. Up to 78 conditions per place. [2023-01-27 18:18:24,245 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 29 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2023-01-27 18:18:24,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 220 flow [2023-01-27 18:18:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:18:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:18:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 401 transitions. [2023-01-27 18:18:24,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987562189054726 [2023-01-27 18:18:24,246 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 401 transitions. [2023-01-27 18:18:24,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 401 transitions. [2023-01-27 18:18:24,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:24,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 401 transitions. [2023-01-27 18:18:24,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:18:24,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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:18:24,249 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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:18:24,249 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 96 flow. Second operand 4 states and 401 transitions. [2023-01-27 18:18:24,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 220 flow [2023-01-27 18:18:24,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:18:24,251 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 132 flow [2023-01-27 18:18:24,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-27 18:18:24,251 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-27 18:18:24,252 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 132 flow [2023-01-27 18:18:24,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:18:24,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:24,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:24,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:18:24,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:24,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash 281488133, now seen corresponding path program 1 times [2023-01-27 18:18:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237444291] [2023-01-27 18:18:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:24,431 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:18:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:24,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237444291] [2023-01-27 18:18:24,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237444291] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:24,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:24,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:18:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217526355] [2023-01-27 18:18:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:24,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:24,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:24,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-01-27 18:18:24,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:18:24,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:24,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-01-27 18:18:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:24,482 INFO L130 PetriNetUnfolder]: 48/107 cut-off events. [2023-01-27 18:18:24,482 INFO L131 PetriNetUnfolder]: For 137/138 co-relation queries the response was YES. [2023-01-27 18:18:24,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 107 events. 48/107 cut-off events. For 137/138 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 255 event pairs, 14 based on Foata normal form. 7/113 useless extension candidates. Maximal degree in co-relation 353. Up to 40 conditions per place. [2023-01-27 18:18:24,483 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 26 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2023-01-27 18:18:24,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 244 flow [2023-01-27 18:18:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-01-27 18:18:24,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48955223880597015 [2023-01-27 18:18:24,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-01-27 18:18:24,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-01-27 18:18:24,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:24,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-01-27 18:18:24,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 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:18:24,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:24,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:18:24,487 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 132 flow. Second operand 5 states and 492 transitions. [2023-01-27 18:18:24,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 244 flow [2023-01-27 18:18:24,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 195 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-01-27 18:18:24,488 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 126 flow [2023-01-27 18:18:24,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-01-27 18:18:24,489 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-27 18:18:24,489 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 126 flow [2023-01-27 18:18:24,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:18:24,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:24,489 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:18:24,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:18:24,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:24,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash 739022676, now seen corresponding path program 1 times [2023-01-27 18:18:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537332681] [2023-01-27 18:18:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:25,206 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:18:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537332681] [2023-01-27 18:18:25,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537332681] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:25,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:25,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:18:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784876199] [2023-01-27 18:18:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:18:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:18:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:18:25,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-01-27 18:18:25,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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:18:25,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:25,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-01-27 18:18:25,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:25,436 INFO L130 PetriNetUnfolder]: 56/130 cut-off events. [2023-01-27 18:18:25,437 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2023-01-27 18:18:25,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 130 events. 56/130 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 380 event pairs, 5 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 412. Up to 65 conditions per place. [2023-01-27 18:18:25,437 INFO L137 encePairwiseOnDemand]: 194/201 looper letters, 28 selfloop transitions, 4 changer transitions 18/52 dead transitions. [2023-01-27 18:18:25,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 363 flow [2023-01-27 18:18:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:18:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:18:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2023-01-27 18:18:25,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44092039800995025 [2023-01-27 18:18:25,439 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 709 transitions. [2023-01-27 18:18:25,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 709 transitions. [2023-01-27 18:18:25,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:25,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 709 transitions. [2023-01-27 18:18:25,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:18:25,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states 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:18:25,442 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states 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:18:25,442 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 126 flow. Second operand 8 states and 709 transitions. [2023-01-27 18:18:25,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 363 flow [2023-01-27 18:18:25,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 307 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-01-27 18:18:25,444 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 116 flow [2023-01-27 18:18:25,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-01-27 18:18:25,444 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-01-27 18:18:25,444 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 116 flow [2023-01-27 18:18:25,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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:18:25,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:25,445 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:18:25,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:18:25,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:25,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1152859416, now seen corresponding path program 2 times [2023-01-27 18:18:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388149960] [2023-01-27 18:18:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:18:25,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:18:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:18:25,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:18:25,514 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:18:25,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:18:25,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:18:25,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:18:25,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:18:25,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:18:25,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:18:25,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:18:25,516 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:25,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:18:25,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:18:25,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:18:25 BasicIcfg [2023-01-27 18:18:25,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:18:25,573 INFO L158 Benchmark]: Toolchain (without parser) took 8747.99ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 310.2MB in the beginning and 347.8MB in the end (delta: -37.6MB). Peak memory consumption was 118.2MB. Max. memory is 16.0GB. [2023-01-27 18:18:25,573 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:18:25,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.73ms. Allocated memory is still 341.8MB. Free memory was 310.2MB in the beginning and 287.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:25,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.19ms. Allocated memory is still 341.8MB. Free memory was 287.3MB in the beginning and 284.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:25,574 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 341.8MB. Free memory was 284.9MB in the beginning and 283.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:25,574 INFO L158 Benchmark]: RCFGBuilder took 589.39ms. Allocated memory is still 341.8MB. Free memory was 282.8MB in the beginning and 250.3MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-27 18:18:25,574 INFO L158 Benchmark]: TraceAbstraction took 7666.32ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 249.6MB in the beginning and 347.8MB in the end (delta: -98.2MB). Peak memory consumption was 57.4MB. Max. memory is 16.0GB. [2023-01-27 18:18:25,575 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 391.73ms. Allocated memory is still 341.8MB. Free memory was 310.2MB in the beginning and 287.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.19ms. Allocated memory is still 341.8MB. Free memory was 287.3MB in the beginning and 284.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 341.8MB. Free memory was 284.9MB in the beginning and 283.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 589.39ms. Allocated memory is still 341.8MB. Free memory was 282.8MB in the beginning and 250.3MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 7666.32ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 249.6MB in the beginning and 347.8MB in the end (delta: -98.2MB). Peak memory consumption was 57.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4829 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2298, independent: 2122, independent conditional: 0, independent unconditional: 2122, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 952, independent: 920, independent conditional: 0, independent unconditional: 920, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2298, independent: 1202, independent conditional: 0, independent unconditional: 1202, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 952, unknown conditional: 0, unknown unconditional: 952] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=1, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=2, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: 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: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 826 IncrementalHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 6 mSDtfsCounter, 826 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=5, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:18:25,595 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...