/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:56:13,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:56:13,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:56:13,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:56:13,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:56:13,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:56:13,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:56:13,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:56:13,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:56:13,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:56:13,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:56:13,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:56:13,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:56:13,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:56:13,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:56:13,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:56:13,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:56:13,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:56:13,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:56:13,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:56:13,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:56:13,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:56:13,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:56:13,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:56:13,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:56:13,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:56:13,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:56:13,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:56:13,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:56:13,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:56:13,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:56:13,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:56:13,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:56:13,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:56:13,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:56:13,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:56:13,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:56:13,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:56:13,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:56:13,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:56:13,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:56:13,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:56:13,604 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:56:13,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:56:13,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:56:13,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:56:13,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:56:13,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:56:13,607 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:56:13,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:56:13,607 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:56:13,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:56:13,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:56:13,609 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:56:13,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:56:13,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:56:13,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:56:13,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:56:13,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:56:13,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:56:13,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:56:13,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:56:13,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:56:13,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:56:13,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:56:13,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:56:13,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:56:13,611 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:56:13,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:56:13,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:56:13,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:56:13,838 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:56:13,839 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:56:13,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:56:14,968 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:56:15,190 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:56:15,191 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:56:15,207 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c34b7347/6c328cf2dc8a49ed9e18c2c74ee63341/FLAG6f245b3c0 [2023-01-28 06:56:15,218 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c34b7347/6c328cf2dc8a49ed9e18c2c74ee63341 [2023-01-28 06:56:15,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:56:15,221 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:56:15,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:56:15,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:56:15,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:56:15,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3becd40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15, skipping insertion in model container [2023-01-28 06:56:15,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:56:15,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:56:15,406 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 06:56:15,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:56:15,614 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:56:15,626 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 06:56:15,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:56:15,726 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:56:15,727 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:56:15,733 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:56:15,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15 WrapperNode [2023-01-28 06:56:15,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:56:15,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:56:15,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:56:15,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:56:15,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,774 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-01-28 06:56:15,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:56:15,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:56:15,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:56:15,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:56:15,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,797 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:56:15,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:56:15,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:56:15,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:56:15,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (1/1) ... [2023-01-28 06:56:15,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:56:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:56:15,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:56:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:56:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:56:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:56:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:56:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:56:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:56:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:56:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:56:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:56:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:56:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:56:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:56:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:56:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:56:15,884 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:56:16,005 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:56:16,029 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:56:16,326 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:56:16,429 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:56:16,430 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:56:16,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:56:16 BoogieIcfgContainer [2023-01-28 06:56:16,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:56:16,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:56:16,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:56:16,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:56:16,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:56:15" (1/3) ... [2023-01-28 06:56:16,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@901ca71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:56:16, skipping insertion in model container [2023-01-28 06:56:16,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:15" (2/3) ... [2023-01-28 06:56:16,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@901ca71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:56:16, skipping insertion in model container [2023-01-28 06:56:16,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:56:16" (3/3) ... [2023-01-28 06:56:16,439 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:56:16,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:56:16,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:56:16,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:56:16,494 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:56:16,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-01-28 06:56:16,558 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-28 06:56:16,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:16,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 06:56:16,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-01-28 06:56:16,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-01-28 06:56:16,570 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:56:16,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-28 06:56:16,581 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-28 06:56:16,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-01-28 06:56:16,614 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-28 06:56:16,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:16,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 06:56:16,617 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-01-28 06:56:19,362 INFO L134 LiptonReduction]: Checked pairs total: 3011 [2023-01-28 06:56:19,362 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-01-28 06:56:19,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:56:19,381 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;@157ee6bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:56:19,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:56:19,387 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:56:19,387 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:19,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:19,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:56:19,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:19,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 408543, now seen corresponding path program 1 times [2023-01-28 06:56:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108050911] [2023-01-28 06:56:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108050911] [2023-01-28 06:56:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108050911] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:56:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337149890] [2023-01-28 06:56:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:19,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:19,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:19,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 170 [2023-01-28 06:56:19,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:19,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:19,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 170 [2023-01-28 06:56:19,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:19,928 INFO L130 PetriNetUnfolder]: 249/470 cut-off events. [2023-01-28 06:56:19,928 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 06:56:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 470 events. 249/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2148 event pairs, 30 based on Foata normal form. 24/446 useless extension candidates. Maximal degree in co-relation 900. Up to 352 conditions per place. [2023-01-28 06:56:19,933 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 25 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2023-01-28 06:56:19,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow [2023-01-28 06:56:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-01-28 06:56:19,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313725490196078 [2023-01-28 06:56:19,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-01-28 06:56:19,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-01-28 06:56:19,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:19,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-01-28 06:56:19,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:19,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:19,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:19,962 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 271 transitions. [2023-01-28 06:56:19,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow [2023-01-28 06:56:19,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:19,966 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-01-28 06:56:19,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-01-28 06:56:19,973 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-01-28 06:56:19,973 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-01-28 06:56:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:19,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:19,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:56:19,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:19,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1756126342, now seen corresponding path program 1 times [2023-01-28 06:56:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:19,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548963188] [2023-01-28 06:56:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548963188] [2023-01-28 06:56:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548963188] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:20,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216001779] [2023-01-28 06:56:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:20,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:20,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 170 [2023-01-28 06:56:20,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:20,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 170 [2023-01-28 06:56:20,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:20,501 INFO L130 PetriNetUnfolder]: 332/603 cut-off events. [2023-01-28 06:56:20,502 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-01-28 06:56:20,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 603 events. 332/603 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2739 event pairs, 86 based on Foata normal form. 45/648 useless extension candidates. Maximal degree in co-relation 1248. Up to 321 conditions per place. [2023-01-28 06:56:20,507 INFO L137 encePairwiseOnDemand]: 163/170 looper letters, 23 selfloop transitions, 5 changer transitions 18/46 dead transitions. [2023-01-28 06:56:20,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 46 transitions, 198 flow [2023-01-28 06:56:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2023-01-28 06:56:20,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47411764705882353 [2023-01-28 06:56:20,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 403 transitions. [2023-01-28 06:56:20,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 403 transitions. [2023-01-28 06:56:20,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:20,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 403 transitions. [2023-01-28 06:56:20,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,520 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 403 transitions. [2023-01-28 06:56:20,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 46 transitions, 198 flow [2023-01-28 06:56:20,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:20,522 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow [2023-01-28 06:56:20,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-28 06:56:20,523 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-01-28 06:56:20,524 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow [2023-01-28 06:56:20,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:20,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:20,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:56:20,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:20,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1394633125, now seen corresponding path program 1 times [2023-01-28 06:56:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92857755] [2023-01-28 06:56:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92857755] [2023-01-28 06:56:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92857755] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115847028] [2023-01-28 06:56:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:20,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:20,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 170 [2023-01-28 06:56:20,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:20,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 170 [2023-01-28 06:56:20,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:20,916 INFO L130 PetriNetUnfolder]: 258/490 cut-off events. [2023-01-28 06:56:20,916 INFO L131 PetriNetUnfolder]: For 316/321 co-relation queries the response was YES. [2023-01-28 06:56:20,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 490 events. 258/490 cut-off events. For 316/321 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2181 event pairs, 97 based on Foata normal form. 39/524 useless extension candidates. Maximal degree in co-relation 1270. Up to 339 conditions per place. [2023-01-28 06:56:20,919 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 20 selfloop transitions, 3 changer transitions 13/38 dead transitions. [2023-01-28 06:56:20,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 208 flow [2023-01-28 06:56:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2023-01-28 06:56:20,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811764705882353 [2023-01-28 06:56:20,921 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 409 transitions. [2023-01-28 06:56:20,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 409 transitions. [2023-01-28 06:56:20,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:20,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 409 transitions. [2023-01-28 06:56:20,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,924 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 5 states and 409 transitions. [2023-01-28 06:56:20,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 208 flow [2023-01-28 06:56:20,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 188 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:20,929 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 83 flow [2023-01-28 06:56:20,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-01-28 06:56:20,931 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2023-01-28 06:56:20,933 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 83 flow [2023-01-28 06:56:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:20,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:20,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:20,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:56:20,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:20,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1233607448, now seen corresponding path program 1 times [2023-01-28 06:56:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:20,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668829511] [2023-01-28 06:56:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:20,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:21,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668829511] [2023-01-28 06:56:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668829511] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425349431] [2023-01-28 06:56:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:21,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:21,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 170 [2023-01-28 06:56:21,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:21,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 170 [2023-01-28 06:56:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:21,234 INFO L130 PetriNetUnfolder]: 73/179 cut-off events. [2023-01-28 06:56:21,234 INFO L131 PetriNetUnfolder]: For 95/96 co-relation queries the response was YES. [2023-01-28 06:56:21,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 179 events. 73/179 cut-off events. For 95/96 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 644 event pairs, 21 based on Foata normal form. 23/201 useless extension candidates. Maximal degree in co-relation 476. Up to 127 conditions per place. [2023-01-28 06:56:21,235 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-01-28 06:56:21,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 187 flow [2023-01-28 06:56:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2023-01-28 06:56:21,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 06:56:21,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 255 transitions. [2023-01-28 06:56:21,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 255 transitions. [2023-01-28 06:56:21,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:21,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 255 transitions. [2023-01-28 06:56:21,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,247 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 83 flow. Second operand 3 states and 255 transitions. [2023-01-28 06:56:21,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 187 flow [2023-01-28 06:56:21,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 171 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-28 06:56:21,251 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 90 flow [2023-01-28 06:56:21,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2023-01-28 06:56:21,252 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-01-28 06:56:21,252 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 90 flow [2023-01-28 06:56:21,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:21,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:21,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:56:21,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:21,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 34550546, now seen corresponding path program 1 times [2023-01-28 06:56:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744300526] [2023-01-28 06:56:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:21,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744300526] [2023-01-28 06:56:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744300526] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:21,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:21,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088285823] [2023-01-28 06:56:21,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:21,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:21,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 170 [2023-01-28 06:56:21,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:21,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 170 [2023-01-28 06:56:21,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:21,624 INFO L130 PetriNetUnfolder]: 31/90 cut-off events. [2023-01-28 06:56:21,624 INFO L131 PetriNetUnfolder]: For 19/20 co-relation queries the response was YES. [2023-01-28 06:56:21,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 90 events. 31/90 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 256 event pairs, 13 based on Foata normal form. 14/103 useless extension candidates. Maximal degree in co-relation 259. Up to 47 conditions per place. [2023-01-28 06:56:21,625 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 24 selfloop transitions, 5 changer transitions 1/32 dead transitions. [2023-01-28 06:56:21,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 186 flow [2023-01-28 06:56:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2023-01-28 06:56:21,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48676470588235293 [2023-01-28 06:56:21,627 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 331 transitions. [2023-01-28 06:56:21,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions. [2023-01-28 06:56:21,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:21,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions. [2023-01-28 06:56:21,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,631 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,631 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 90 flow. Second operand 4 states and 331 transitions. [2023-01-28 06:56:21,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 186 flow [2023-01-28 06:56:21,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 170 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:21,633 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 94 flow [2023-01-28 06:56:21,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-01-28 06:56:21,635 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-01-28 06:56:21,635 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 94 flow [2023-01-28 06:56:21,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:21,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:21,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:21,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:56:21,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:21,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 104746922, now seen corresponding path program 1 times [2023-01-28 06:56:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822006585] [2023-01-28 06:56:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:22,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:22,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822006585] [2023-01-28 06:56:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822006585] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:22,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:22,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340472238] [2023-01-28 06:56:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:22,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:22,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 170 [2023-01-28 06:56:22,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:22,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:22,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 170 [2023-01-28 06:56:22,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:22,434 INFO L130 PetriNetUnfolder]: 42/126 cut-off events. [2023-01-28 06:56:22,435 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-01-28 06:56:22,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 126 events. 42/126 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 422 event pairs, 4 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 374. Up to 38 conditions per place. [2023-01-28 06:56:22,436 INFO L137 encePairwiseOnDemand]: 159/170 looper letters, 18 selfloop transitions, 9 changer transitions 32/59 dead transitions. [2023-01-28 06:56:22,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 59 transitions, 373 flow [2023-01-28 06:56:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 590 transitions. [2023-01-28 06:56:22,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-01-28 06:56:22,438 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 590 transitions. [2023-01-28 06:56:22,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 590 transitions. [2023-01-28 06:56:22,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:22,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 590 transitions. [2023-01-28 06:56:22,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 73.75) internal successors, (590), 8 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:22,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:22,442 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:22,442 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 94 flow. Second operand 8 states and 590 transitions. [2023-01-28 06:56:22,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 59 transitions, 373 flow [2023-01-28 06:56:22,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 59 transitions, 344 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:22,444 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 137 flow [2023-01-28 06:56:22,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-01-28 06:56:22,445 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2023-01-28 06:56:22,445 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 137 flow [2023-01-28 06:56:22,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:22,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:22,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:56:22,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:56:22,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1566882144, now seen corresponding path program 2 times [2023-01-28 06:56:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568922450] [2023-01-28 06:56:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:22,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:56:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:22,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:56:22,559 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:56:22,560 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:56:22,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:56:22,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:56:22,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:56:22,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:56:22,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:56:22,562 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-01-28 06:56:22,567 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:56:22,567 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:56:22,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:56:22 BasicIcfg [2023-01-28 06:56:22,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:56:22,670 INFO L158 Benchmark]: Toolchain (without parser) took 7449.10ms. Allocated memory was 371.2MB in the beginning and 446.7MB in the end (delta: 75.5MB). Free memory was 319.0MB in the beginning and 418.8MB in the end (delta: -99.8MB). Peak memory consumption was 175.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:22,671 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:22,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.35ms. Allocated memory is still 371.2MB. Free memory was 318.8MB in the beginning and 342.1MB in the end (delta: -23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 06:56:22,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.16ms. Allocated memory is still 371.2MB. Free memory was 342.1MB in the beginning and 339.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:22,671 INFO L158 Benchmark]: Boogie Preprocessor took 25.81ms. Allocated memory is still 371.2MB. Free memory was 339.3MB in the beginning and 337.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:22,671 INFO L158 Benchmark]: RCFGBuilder took 630.36ms. Allocated memory is still 371.2MB. Free memory was 337.9MB in the beginning and 304.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 06:56:22,672 INFO L158 Benchmark]: TraceAbstraction took 6236.54ms. Allocated memory was 371.2MB in the beginning and 446.7MB in the end (delta: 75.5MB). Free memory was 303.7MB in the beginning and 418.8MB in the end (delta: -115.1MB). Peak memory consumption was 158.3MB. Max. memory is 16.0GB. [2023-01-28 06:56:22,673 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 511.35ms. Allocated memory is still 371.2MB. Free memory was 318.8MB in the beginning and 342.1MB in the end (delta: -23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.16ms. Allocated memory is still 371.2MB. Free memory was 342.1MB in the beginning and 339.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.81ms. Allocated memory is still 371.2MB. Free memory was 339.3MB in the beginning and 337.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 630.36ms. Allocated memory is still 371.2MB. Free memory was 337.9MB in the beginning and 304.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 6236.54ms. Allocated memory was 371.2MB in the beginning and 446.7MB in the end (delta: 75.5MB). Free memory was 303.7MB in the beginning and 418.8MB in the end (delta: -115.1MB). Peak memory consumption was 158.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 3011 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1285, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 608, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1285, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 608, unknown conditional: 0, unknown unconditional: 608] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1089, ((void *)0), P0, ((void *)0))=-1, t1089={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1090, ((void *)0), P1, ((void *)0))=0, t1089={5:0}, t1090={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089={5:0}, t1090={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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 5 procedures, 111 locations, 5 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: 6.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=6, InterpolantAutomatonStates: 28, 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, 1.6s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:56:22,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...