/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:01:07,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:01:07,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:01:07,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:01:07,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:01:07,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:01:07,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:01:07,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:01:07,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:01:07,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:01:07,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:01:07,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:01:07,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:01:07,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:01:07,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:01:07,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:01:07,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:01:07,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:01:07,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:01:07,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:01:07,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:01:07,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:01:07,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:01:07,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:01:07,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:01:07,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:01:07,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:01:07,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:01:07,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:01:07,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:01:07,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:01:07,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:01:07,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:01:07,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:01:07,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:01:07,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:01:07,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:01:07,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:01:07,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:01:07,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:01:07,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:01:07,813 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 07:01:07,835 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:01:07,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:01:07,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:01:07,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:01:07,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:01:07,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:01:07,837 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:01:07,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:01:07,837 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:01:07,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:01:07,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:01:07,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:01:07,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:01:07,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:01:07,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:01:07,838 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:01:07,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:01:07,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:01:07,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:01:07,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:01:07,840 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:01:07,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:01:07,840 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 07:01:08,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:01:08,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:01:08,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:01:08,044 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:01:08,045 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:01:08,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-01-28 07:01:09,106 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:01:09,401 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:01:09,402 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-01-28 07:01:09,415 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2208530/20f915023721465d9e8e98665a56c0a0/FLAG6ce22b86f [2023-01-28 07:01:09,425 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2208530/20f915023721465d9e8e98665a56c0a0 [2023-01-28 07:01:09,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:01:09,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:01:09,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:01:09,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:01:09,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:01:09,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d41cafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09, skipping insertion in model container [2023-01-28 07:01:09,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:01:09,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:01:09,574 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-01-28 07:01:09,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:01:09,717 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:01:09,727 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-01-28 07:01:09,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:01:09,813 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:01:09,813 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:01:09,818 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:01:09,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09 WrapperNode [2023-01-28 07:01:09,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:01:09,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:01:09,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:01:09,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:01:09,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,880 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-28 07:01:09,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:01:09,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:01:09,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:01:09,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:01:09,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:01:09,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:01:09,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:01:09,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:01:09,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (1/1) ... [2023-01-28 07:01:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:01:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:01:09,970 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 07:01:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:01:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:01:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:01:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:01:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:01:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:01:09,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:01:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:01:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:01:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 07:01:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 07:01:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:01:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:01:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:01:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:01:09,998 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 07:01:09,974 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 07:01:10,172 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:01:10,173 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:01:10,483 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:01:10,641 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:01:10,641 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:01:10,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:01:10 BoogieIcfgContainer [2023-01-28 07:01:10,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:01:10,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:01:10,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:01:10,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:01:10,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:01:09" (1/3) ... [2023-01-28 07:01:10,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8667894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:01:10, skipping insertion in model container [2023-01-28 07:01:10,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:09" (2/3) ... [2023-01-28 07:01:10,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8667894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:01:10, skipping insertion in model container [2023-01-28 07:01:10,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:01:10" (3/3) ... [2023-01-28 07:01:10,651 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-01-28 07:01:10,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:01:10,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:01:10,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:01:10,732 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:01:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 07:01:10,798 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 07:01:10,798 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:01:10,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 07:01:10,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 07:01:10,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-28 07:01:10,809 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:01:10,817 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 07:01:10,819 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 07:01:10,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-28 07:01:10,840 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 07:01:10,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:01:10,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 07:01:10,842 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-28 07:01:14,081 INFO L134 LiptonReduction]: Checked pairs total: 4735 [2023-01-28 07:01:14,081 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 07:01:14,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:01:14,100 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;@1216e756, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:01:14,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 07:01:14,103 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 07:01:14,103 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:01:14,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:14,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 07:01:14,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:14,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 469687, now seen corresponding path program 1 times [2023-01-28 07:01:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183064086] [2023-01-28 07:01:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:14,412 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 07:01:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183064086] [2023-01-28 07:01:14,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183064086] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:14,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:14,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:01:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914679543] [2023-01-28 07:01:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:01:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:14,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:01:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:01:14,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-01-28 07:01:14,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 07:01:14,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:14,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-01-28 07:01:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:14,725 INFO L130 PetriNetUnfolder]: 711/1170 cut-off events. [2023-01-28 07:01:14,726 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 07:01:14,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1170 events. 711/1170 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6125 event pairs, 111 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 2278. Up to 871 conditions per place. [2023-01-28 07:01:14,735 INFO L137 encePairwiseOnDemand]: 198/201 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-01-28 07:01:14,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2023-01-28 07:01:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:01:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:01:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-01-28 07:01:14,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190713101160862 [2023-01-28 07:01:14,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-01-28 07:01:14,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-01-28 07:01:14,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:14,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-01-28 07:01:14,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 07:01:14,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,764 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 313 transitions. [2023-01-28 07:01:14,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2023-01-28 07:01:14,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:01:14,767 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-28 07:01:14,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-28 07:01:14,772 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-28 07:01:14,772 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-28 07:01:14,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 07:01:14,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:14,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:14,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:01:14,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:14,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -205373446, now seen corresponding path program 1 times [2023-01-28 07:01:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888890123] [2023-01-28 07:01:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:15,548 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 07:01:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888890123] [2023-01-28 07:01:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888890123] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:01:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289519931] [2023-01-28 07:01:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:15,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:15,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 07:01:15,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 07:01:15,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:15,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 07:01:15,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:15,765 INFO L130 PetriNetUnfolder]: 1042/1647 cut-off events. [2023-01-28 07:01:15,765 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2023-01-28 07:01:15,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1647 events. 1042/1647 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7978 event pairs, 166 based on Foata normal form. 30/1677 useless extension candidates. Maximal degree in co-relation 3346. Up to 1323 conditions per place. [2023-01-28 07:01:15,773 INFO L137 encePairwiseOnDemand]: 192/201 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-01-28 07:01:15,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 210 flow [2023-01-28 07:01:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 373 transitions. [2023-01-28 07:01:15,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639303482587065 [2023-01-28 07:01:15,775 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 373 transitions. [2023-01-28 07:01:15,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 373 transitions. [2023-01-28 07:01:15,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:15,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 373 transitions. [2023-01-28 07:01:15,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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 07:01:15,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,779 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,779 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 373 transitions. [2023-01-28 07:01:15,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 210 flow [2023-01-28 07:01:15,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:15,782 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2023-01-28 07:01:15,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-01-28 07:01:15,783 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-01-28 07:01:15,783 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2023-01-28 07:01:15,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 07:01:15,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:15,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:15,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:01:15,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:15,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2071610583, now seen corresponding path program 1 times [2023-01-28 07:01:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056635440] [2023-01-28 07:01:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:16,362 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 07:01:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056635440] [2023-01-28 07:01:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056635440] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:01:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267415196] [2023-01-28 07:01:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:16,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:16,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:16,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 07:01:16,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 07:01:16,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:16,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 07:01:16,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:16,572 INFO L130 PetriNetUnfolder]: 992/1504 cut-off events. [2023-01-28 07:01:16,572 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2023-01-28 07:01:16,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 1504 events. 992/1504 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6494 event pairs, 181 based on Foata normal form. 18/1520 useless extension candidates. Maximal degree in co-relation 4173. Up to 1076 conditions per place. [2023-01-28 07:01:16,579 INFO L137 encePairwiseOnDemand]: 192/201 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-01-28 07:01:16,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 273 flow [2023-01-28 07:01:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2023-01-28 07:01:16,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45149253731343286 [2023-01-28 07:01:16,581 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 363 transitions. [2023-01-28 07:01:16,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 363 transitions. [2023-01-28 07:01:16,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:16,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 363 transitions. [2023-01-28 07:01:16,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 07:01:16,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:16,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:16,583 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 4 states and 363 transitions. [2023-01-28 07:01:16,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 273 flow [2023-01-28 07:01:16,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:01:16,587 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 196 flow [2023-01-28 07:01:16,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-01-28 07:01:16,588 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-01-28 07:01:16,590 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 196 flow [2023-01-28 07:01:16,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 07:01:16,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:16,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:16,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:01:16,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:16,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1204847949, now seen corresponding path program 1 times [2023-01-28 07:01:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132032979] [2023-01-28 07:01:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:17,288 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 07:01:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132032979] [2023-01-28 07:01:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132032979] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203108952] [2023-01-28 07:01:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:17,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:17,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 07:01:17,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 07:01:17,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:17,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 07:01:17,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:17,516 INFO L130 PetriNetUnfolder]: 1098/1666 cut-off events. [2023-01-28 07:01:17,516 INFO L131 PetriNetUnfolder]: For 1730/1730 co-relation queries the response was YES. [2023-01-28 07:01:17,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 1666 events. 1098/1666 cut-off events. For 1730/1730 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7387 event pairs, 293 based on Foata normal form. 12/1677 useless extension candidates. Maximal degree in co-relation 5319. Up to 1280 conditions per place. [2023-01-28 07:01:17,526 INFO L137 encePairwiseOnDemand]: 190/201 looper letters, 41 selfloop transitions, 23 changer transitions 0/65 dead transitions. [2023-01-28 07:01:17,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 446 flow [2023-01-28 07:01:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-01-28 07:01:17,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651741293532338 [2023-01-28 07:01:17,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-01-28 07:01:17,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-01-28 07:01:17,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:17,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-01-28 07:01:17,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 07:01:17,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,536 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,536 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 196 flow. Second operand 4 states and 374 transitions. [2023-01-28 07:01:17,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 446 flow [2023-01-28 07:01:17,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:01:17,545 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 375 flow [2023-01-28 07:01:17,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2023-01-28 07:01:17,547 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-01-28 07:01:17,547 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 375 flow [2023-01-28 07:01:17,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 07:01:17,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:17,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:17,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:01:17,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:17,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2046726141, now seen corresponding path program 1 times [2023-01-28 07:01:17,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:17,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113223913] [2023-01-28 07:01:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:18,018 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 07:01:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113223913] [2023-01-28 07:01:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113223913] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:01:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889591416] [2023-01-28 07:01:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:18,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:18,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-01-28 07:01:18,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 07:01:18,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:18,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-01-28 07:01:18,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:18,383 INFO L130 PetriNetUnfolder]: 1610/2375 cut-off events. [2023-01-28 07:01:18,383 INFO L131 PetriNetUnfolder]: For 5678/5678 co-relation queries the response was YES. [2023-01-28 07:01:18,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 2375 events. 1610/2375 cut-off events. For 5678/5678 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10749 event pairs, 163 based on Foata normal form. 22/2397 useless extension candidates. Maximal degree in co-relation 9327. Up to 1262 conditions per place. [2023-01-28 07:01:18,397 INFO L137 encePairwiseOnDemand]: 190/201 looper letters, 65 selfloop transitions, 51 changer transitions 0/116 dead transitions. [2023-01-28 07:01:18,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 116 transitions, 1051 flow [2023-01-28 07:01:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:01:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:01:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-01-28 07:01:18,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45870646766169154 [2023-01-28 07:01:18,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-01-28 07:01:18,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-01-28 07:01:18,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:18,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-01-28 07:01:18,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 07:01:18,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:18,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:18,402 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 375 flow. Second operand 5 states and 461 transitions. [2023-01-28 07:01:18,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 116 transitions, 1051 flow [2023-01-28 07:01:18,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 116 transitions, 1051 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:01:18,414 INFO L231 Difference]: Finished difference. Result has 52 places, 81 transitions, 921 flow [2023-01-28 07:01:18,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=921, PETRI_PLACES=52, PETRI_TRANSITIONS=81} [2023-01-28 07:01:18,415 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-01-28 07:01:18,415 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 81 transitions, 921 flow [2023-01-28 07:01:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 07:01:18,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:18,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:18,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:01:18,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:18,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash -500207653, now seen corresponding path program 2 times [2023-01-28 07:01:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147666078] [2023-01-28 07:01:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:18,829 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 07:01:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:18,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147666078] [2023-01-28 07:01:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147666078] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:18,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441429773] [2023-01-28 07:01:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:18,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:18,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 07:01:18,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 81 transitions, 921 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 07:01:18,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:18,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 07:01:18,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:19,151 INFO L130 PetriNetUnfolder]: 1811/2770 cut-off events. [2023-01-28 07:01:19,151 INFO L131 PetriNetUnfolder]: For 11617/11746 co-relation queries the response was YES. [2023-01-28 07:01:19,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13616 conditions, 2770 events. 1811/2770 cut-off events. For 11617/11746 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14006 event pairs, 344 based on Foata normal form. 135/2905 useless extension candidates. Maximal degree in co-relation 13589. Up to 1441 conditions per place. [2023-01-28 07:01:19,165 INFO L137 encePairwiseOnDemand]: 194/201 looper letters, 77 selfloop transitions, 16 changer transitions 17/112 dead transitions. [2023-01-28 07:01:19,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 1347 flow [2023-01-28 07:01:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-01-28 07:01:19,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458955223880597 [2023-01-28 07:01:19,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-01-28 07:01:19,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-01-28 07:01:19,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:19,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-01-28 07:01:19,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 07:01:19,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:19,169 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:19,169 INFO L175 Difference]: Start difference. First operand has 52 places, 81 transitions, 921 flow. Second operand 4 states and 369 transitions. [2023-01-28 07:01:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 1347 flow [2023-01-28 07:01:19,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 1347 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:01:19,192 INFO L231 Difference]: Finished difference. Result has 57 places, 73 transitions, 840 flow [2023-01-28 07:01:19,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=840, PETRI_PLACES=57, PETRI_TRANSITIONS=73} [2023-01-28 07:01:19,193 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-01-28 07:01:19,193 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 73 transitions, 840 flow [2023-01-28 07:01:19,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 07:01:19,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:19,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:19,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:01:19,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:19,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1998069440, now seen corresponding path program 1 times [2023-01-28 07:01:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141051468] [2023-01-28 07:01:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:19,698 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 07:01:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:19,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141051468] [2023-01-28 07:01:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141051468] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:19,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:19,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:01:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396887957] [2023-01-28 07:01:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:19,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:01:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:01:19,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:01:19,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-01-28 07:01:19,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 73 transitions, 840 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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 07:01:19,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:19,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-01-28 07:01:19,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:20,310 INFO L130 PetriNetUnfolder]: 2306/3476 cut-off events. [2023-01-28 07:01:20,311 INFO L131 PetriNetUnfolder]: For 17415/17415 co-relation queries the response was YES. [2023-01-28 07:01:20,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17126 conditions, 3476 events. 2306/3476 cut-off events. For 17415/17415 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17546 event pairs, 292 based on Foata normal form. 36/3512 useless extension candidates. Maximal degree in co-relation 17095. Up to 1748 conditions per place. [2023-01-28 07:01:20,331 INFO L137 encePairwiseOnDemand]: 190/201 looper letters, 98 selfloop transitions, 89 changer transitions 8/195 dead transitions. [2023-01-28 07:01:20,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 195 transitions, 2376 flow [2023-01-28 07:01:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 07:01:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 07:01:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2023-01-28 07:01:20,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2023-01-28 07:01:20,333 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 819 transitions. [2023-01-28 07:01:20,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 819 transitions. [2023-01-28 07:01:20,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:20,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 819 transitions. [2023-01-28 07:01:20,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.0) internal successors, (819), 9 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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 07:01:20,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:20,336 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:20,336 INFO L175 Difference]: Start difference. First operand has 57 places, 73 transitions, 840 flow. Second operand 9 states and 819 transitions. [2023-01-28 07:01:20,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 195 transitions, 2376 flow [2023-01-28 07:01:20,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 195 transitions, 2303 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:20,368 INFO L231 Difference]: Finished difference. Result has 70 places, 132 transitions, 1844 flow [2023-01-28 07:01:20,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1844, PETRI_PLACES=70, PETRI_TRANSITIONS=132} [2023-01-28 07:01:20,369 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2023-01-28 07:01:20,369 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 132 transitions, 1844 flow [2023-01-28 07:01:20,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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 07:01:20,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:20,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:20,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:01:20,369 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:20,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1112376283, now seen corresponding path program 1 times [2023-01-28 07:01:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233253509] [2023-01-28 07:01:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:20,769 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 07:01:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:20,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233253509] [2023-01-28 07:01:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233253509] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:20,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503792460] [2023-01-28 07:01:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:20,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:20,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-01-28 07:01:20,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 132 transitions, 1844 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 07:01:20,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:20,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-01-28 07:01:20,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:21,262 INFO L130 PetriNetUnfolder]: 2656/4068 cut-off events. [2023-01-28 07:01:21,262 INFO L131 PetriNetUnfolder]: For 31010/31010 co-relation queries the response was YES. [2023-01-28 07:01:21,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22870 conditions, 4068 events. 2656/4068 cut-off events. For 31010/31010 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 21488 event pairs, 488 based on Foata normal form. 80/4148 useless extension candidates. Maximal degree in co-relation 22832. Up to 1700 conditions per place. [2023-01-28 07:01:21,280 INFO L137 encePairwiseOnDemand]: 193/201 looper letters, 58 selfloop transitions, 9 changer transitions 98/165 dead transitions. [2023-01-28 07:01:21,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 165 transitions, 2446 flow [2023-01-28 07:01:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:01:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:01:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-01-28 07:01:21,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445771144278607 [2023-01-28 07:01:21,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-01-28 07:01:21,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-01-28 07:01:21,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:21,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-01-28 07:01:21,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,284 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,284 INFO L175 Difference]: Start difference. First operand has 70 places, 132 transitions, 1844 flow. Second operand 5 states and 448 transitions. [2023-01-28 07:01:21,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 165 transitions, 2446 flow [2023-01-28 07:01:21,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 165 transitions, 2404 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 07:01:21,337 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 610 flow [2023-01-28 07:01:21,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2023-01-28 07:01:21,338 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2023-01-28 07:01:21,338 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 610 flow [2023-01-28 07:01:21,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 07:01:21,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:21,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:21,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:01:21,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:21,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -993376159, now seen corresponding path program 1 times [2023-01-28 07:01:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:21,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944212808] [2023-01-28 07:01:21,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:21,670 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 07:01:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944212808] [2023-01-28 07:01:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944212808] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:01:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300737555] [2023-01-28 07:01:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:21,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:21,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:21,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-01-28 07:01:21,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:21,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-01-28 07:01:21,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:21,912 INFO L130 PetriNetUnfolder]: 945/1531 cut-off events. [2023-01-28 07:01:21,913 INFO L131 PetriNetUnfolder]: For 12936/12969 co-relation queries the response was YES. [2023-01-28 07:01:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8705 conditions, 1531 events. 945/1531 cut-off events. For 12936/12969 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7203 event pairs, 335 based on Foata normal form. 36/1562 useless extension candidates. Maximal degree in co-relation 8664. Up to 1290 conditions per place. [2023-01-28 07:01:21,921 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 53 selfloop transitions, 12 changer transitions 2/73 dead transitions. [2023-01-28 07:01:21,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 936 flow [2023-01-28 07:01:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-01-28 07:01:21,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975124378109453 [2023-01-28 07:01:21,923 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-01-28 07:01:21,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-01-28 07:01:21,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:21,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-01-28 07:01:21,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 07:01:21,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,925 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 610 flow. Second operand 4 states and 400 transitions. [2023-01-28 07:01:21,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 936 flow [2023-01-28 07:01:21,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 772 flow, removed 34 selfloop flow, removed 17 redundant places. [2023-01-28 07:01:21,943 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 568 flow [2023-01-28 07:01:21,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=568, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-01-28 07:01:21,943 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-01-28 07:01:21,944 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 568 flow [2023-01-28 07:01:21,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:21,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:21,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:21,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:01:21,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:21,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1577164360, now seen corresponding path program 1 times [2023-01-28 07:01:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426185745] [2023-01-28 07:01:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:22,196 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 07:01:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426185745] [2023-01-28 07:01:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426185745] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:22,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579775144] [2023-01-28 07:01:22,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:22,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:22,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-01-28 07:01:22,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:22,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:22,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-01-28 07:01:22,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:22,387 INFO L130 PetriNetUnfolder]: 886/1453 cut-off events. [2023-01-28 07:01:22,388 INFO L131 PetriNetUnfolder]: For 7089/7128 co-relation queries the response was YES. [2023-01-28 07:01:22,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7401 conditions, 1453 events. 886/1453 cut-off events. For 7089/7128 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6821 event pairs, 391 based on Foata normal form. 48/1499 useless extension candidates. Maximal degree in co-relation 7371. Up to 1255 conditions per place. [2023-01-28 07:01:22,394 INFO L137 encePairwiseOnDemand]: 197/201 looper letters, 58 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-01-28 07:01:22,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 823 flow [2023-01-28 07:01:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2023-01-28 07:01:22,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900497512437811 [2023-01-28 07:01:22,396 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 394 transitions. [2023-01-28 07:01:22,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 394 transitions. [2023-01-28 07:01:22,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:22,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 394 transitions. [2023-01-28 07:01:22,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 07:01:22,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:22,400 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:22,400 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 568 flow. Second operand 4 states and 394 transitions. [2023-01-28 07:01:22,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 823 flow [2023-01-28 07:01:22,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 807 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:22,409 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 571 flow [2023-01-28 07:01:22,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=571, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-01-28 07:01:22,410 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2023-01-28 07:01:22,411 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 571 flow [2023-01-28 07:01:22,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:22,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:22,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:22,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:01:22,411 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:22,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 249893119, now seen corresponding path program 1 times [2023-01-28 07:01:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749562973] [2023-01-28 07:01:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:23,127 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 07:01:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:23,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749562973] [2023-01-28 07:01:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749562973] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:23,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:23,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:01:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363379404] [2023-01-28 07:01:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:23,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:01:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:01:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:01:23,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 201 [2023-01-28 07:01:23,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 07:01:23,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:23,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 201 [2023-01-28 07:01:23,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:23,330 INFO L130 PetriNetUnfolder]: 872/1429 cut-off events. [2023-01-28 07:01:23,330 INFO L131 PetriNetUnfolder]: For 7200/7239 co-relation queries the response was YES. [2023-01-28 07:01:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 1429 events. 872/1429 cut-off events. For 7200/7239 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6672 event pairs, 257 based on Foata normal form. 43/1470 useless extension candidates. Maximal degree in co-relation 7299. Up to 1111 conditions per place. [2023-01-28 07:01:23,336 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 55 selfloop transitions, 12 changer transitions 1/74 dead transitions. [2023-01-28 07:01:23,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 834 flow [2023-01-28 07:01:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-01-28 07:01:23,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2023-01-28 07:01:23,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-01-28 07:01:23,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-01-28 07:01:23,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:23,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-01-28 07:01:23,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 07:01:23,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:23,340 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:23,340 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 571 flow. Second operand 4 states and 384 transitions. [2023-01-28 07:01:23,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 834 flow [2023-01-28 07:01:23,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 821 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:23,348 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 618 flow [2023-01-28 07:01:23,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-01-28 07:01:23,349 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2023-01-28 07:01:23,349 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 618 flow [2023-01-28 07:01:23,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 07:01:23,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:23,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:23,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:01:23,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:23,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash 251251105, now seen corresponding path program 1 times [2023-01-28 07:01:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:23,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741981397] [2023-01-28 07:01:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:23,659 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 07:01:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741981397] [2023-01-28 07:01:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741981397] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:01:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859532479] [2023-01-28 07:01:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:23,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:01:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:01:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:01:23,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-01-28 07:01:23,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 07:01:23,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:23,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-01-28 07:01:23,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:23,942 INFO L130 PetriNetUnfolder]: 935/1545 cut-off events. [2023-01-28 07:01:23,942 INFO L131 PetriNetUnfolder]: For 9791/9830 co-relation queries the response was YES. [2023-01-28 07:01:23,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8321 conditions, 1545 events. 935/1545 cut-off events. For 9791/9830 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7511 event pairs, 322 based on Foata normal form. 57/1594 useless extension candidates. Maximal degree in co-relation 8289. Up to 1151 conditions per place. [2023-01-28 07:01:23,949 INFO L137 encePairwiseOnDemand]: 194/201 looper letters, 61 selfloop transitions, 15 changer transitions 3/85 dead transitions. [2023-01-28 07:01:23,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 1014 flow [2023-01-28 07:01:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:01:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:01:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2023-01-28 07:01:23,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759535655058043 [2023-01-28 07:01:23,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 574 transitions. [2023-01-28 07:01:23,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 574 transitions. [2023-01-28 07:01:23,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:23,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 574 transitions. [2023-01-28 07:01:23,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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 07:01:23,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:23,954 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:23,954 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 618 flow. Second operand 6 states and 574 transitions. [2023-01-28 07:01:23,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 1014 flow [2023-01-28 07:01:23,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 998 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:23,963 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 724 flow [2023-01-28 07:01:23,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-01-28 07:01:23,965 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2023-01-28 07:01:23,965 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 724 flow [2023-01-28 07:01:23,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 07:01:23,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:23,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:23,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 07:01:23,965 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:23,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1792423090, now seen corresponding path program 1 times [2023-01-28 07:01:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855459182] [2023-01-28 07:01:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:24,098 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 07:01:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:24,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855459182] [2023-01-28 07:01:24,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855459182] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:24,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:24,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424154664] [2023-01-28 07:01:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:24,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:24,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-01-28 07:01:24,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 724 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 07:01:24,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:24,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-01-28 07:01:24,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:24,295 INFO L130 PetriNetUnfolder]: 643/1157 cut-off events. [2023-01-28 07:01:24,295 INFO L131 PetriNetUnfolder]: For 12085/12279 co-relation queries the response was YES. [2023-01-28 07:01:24,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 1157 events. 643/1157 cut-off events. For 12085/12279 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6171 event pairs, 95 based on Foata normal form. 247/1396 useless extension candidates. Maximal degree in co-relation 6488. Up to 657 conditions per place. [2023-01-28 07:01:24,299 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 66 selfloop transitions, 6 changer transitions 51/131 dead transitions. [2023-01-28 07:01:24,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1856 flow [2023-01-28 07:01:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:01:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:01:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-28 07:01:24,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-01-28 07:01:24,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-28 07:01:24,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-28 07:01:24,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:24,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-28 07:01:24,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:24,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:24,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:24,303 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 724 flow. Second operand 5 states and 487 transitions. [2023-01-28 07:01:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1856 flow [2023-01-28 07:01:24,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 1767 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-01-28 07:01:24,309 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 624 flow [2023-01-28 07:01:24,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=624, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-01-28 07:01:24,310 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2023-01-28 07:01:24,310 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 624 flow [2023-01-28 07:01:24,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 07:01:24,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:24,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:24,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 07:01:24,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:24,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1767515392, now seen corresponding path program 1 times [2023-01-28 07:01:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513385243] [2023-01-28 07:01:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:24,443 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 07:01:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513385243] [2023-01-28 07:01:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513385243] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:01:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250266719] [2023-01-28 07:01:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:24,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:24,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:24,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-01-28 07:01:24,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 624 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 07:01:24,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:24,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-01-28 07:01:24,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:24,633 INFO L130 PetriNetUnfolder]: 448/856 cut-off events. [2023-01-28 07:01:24,633 INFO L131 PetriNetUnfolder]: For 9002/9116 co-relation queries the response was YES. [2023-01-28 07:01:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 856 events. 448/856 cut-off events. For 9002/9116 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4469 event pairs, 40 based on Foata normal form. 164/1012 useless extension candidates. Maximal degree in co-relation 5180. Up to 365 conditions per place. [2023-01-28 07:01:24,636 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 70 selfloop transitions, 10 changer transitions 63/151 dead transitions. [2023-01-28 07:01:24,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 2069 flow [2023-01-28 07:01:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:01:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:01:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-01-28 07:01:24,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48187633262260127 [2023-01-28 07:01:24,638 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-01-28 07:01:24,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-01-28 07:01:24,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:24,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-01-28 07:01:24,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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 07:01:24,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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 07:01:24,641 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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 07:01:24,641 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 624 flow. Second operand 7 states and 678 transitions. [2023-01-28 07:01:24,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 2069 flow [2023-01-28 07:01:24,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 2021 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 07:01:24,649 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 628 flow [2023-01-28 07:01:24,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=628, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2023-01-28 07:01:24,650 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2023-01-28 07:01:24,650 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 628 flow [2023-01-28 07:01:24,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 07:01:24,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:24,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:24,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 07:01:24,651 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:24,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1311539303, now seen corresponding path program 1 times [2023-01-28 07:01:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872184942] [2023-01-28 07:01:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:24,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:24,814 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 07:01:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:24,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872184942] [2023-01-28 07:01:24,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872184942] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:24,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:24,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:01:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465050911] [2023-01-28 07:01:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:24,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:01:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:01:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:01:24,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-01-28 07:01:24,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states 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 07:01:24,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:24,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-01-28 07:01:24,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:24,971 INFO L130 PetriNetUnfolder]: 362/698 cut-off events. [2023-01-28 07:01:24,972 INFO L131 PetriNetUnfolder]: For 7123/7204 co-relation queries the response was YES. [2023-01-28 07:01:24,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 698 events. 362/698 cut-off events. For 7123/7204 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3596 event pairs, 37 based on Foata normal form. 86/777 useless extension candidates. Maximal degree in co-relation 4485. Up to 288 conditions per place. [2023-01-28 07:01:24,975 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 43 selfloop transitions, 10 changer transitions 82/141 dead transitions. [2023-01-28 07:01:24,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 1930 flow [2023-01-28 07:01:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 07:01:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 07:01:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 850 transitions. [2023-01-28 07:01:24,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987285793255945 [2023-01-28 07:01:24,977 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 850 transitions. [2023-01-28 07:01:24,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 850 transitions. [2023-01-28 07:01:24,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:24,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 850 transitions. [2023-01-28 07:01:24,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.44444444444444) internal successors, (850), 9 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 07:01:24,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:24,981 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:24,981 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 628 flow. Second operand 9 states and 850 transitions. [2023-01-28 07:01:24,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 1930 flow [2023-01-28 07:01:24,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 141 transitions, 1832 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-01-28 07:01:24,990 INFO L231 Difference]: Finished difference. Result has 81 places, 39 transitions, 395 flow [2023-01-28 07:01:24,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=81, PETRI_TRANSITIONS=39} [2023-01-28 07:01:24,992 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2023-01-28 07:01:24,992 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 39 transitions, 395 flow [2023-01-28 07:01:24,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states 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 07:01:24,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:24,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:24,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 07:01:24,992 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:24,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1201597487, now seen corresponding path program 1 times [2023-01-28 07:01:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557929549] [2023-01-28 07:01:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:25,625 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 07:01:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557929549] [2023-01-28 07:01:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557929549] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 07:01:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150130227] [2023-01-28 07:01:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:25,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 07:01:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 07:01:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 07:01:25,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-01-28 07:01:25,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 39 transitions, 395 flow. Second operand has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 07:01:25,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:25,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-01-28 07:01:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:25,750 INFO L130 PetriNetUnfolder]: 121/248 cut-off events. [2023-01-28 07:01:25,750 INFO L131 PetriNetUnfolder]: For 1610/1610 co-relation queries the response was YES. [2023-01-28 07:01:25,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 248 events. 121/248 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 793 event pairs, 18 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 1475. Up to 166 conditions per place. [2023-01-28 07:01:25,752 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 42 selfloop transitions, 16 changer transitions 6/67 dead transitions. [2023-01-28 07:01:25,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 772 flow [2023-01-28 07:01:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:01:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:01:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-01-28 07:01:25,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44859038142620233 [2023-01-28 07:01:25,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-01-28 07:01:25,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-01-28 07:01:25,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:25,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-01-28 07:01:25,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 07:01:25,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:25,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:25,758 INFO L175 Difference]: Start difference. First operand has 81 places, 39 transitions, 395 flow. Second operand 6 states and 541 transitions. [2023-01-28 07:01:25,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 772 flow [2023-01-28 07:01:25,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 545 flow, removed 72 selfloop flow, removed 22 redundant places. [2023-01-28 07:01:25,762 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 350 flow [2023-01-28 07:01:25,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-01-28 07:01:25,762 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-01-28 07:01:25,762 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 350 flow [2023-01-28 07:01:25,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 07:01:25,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:25,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:25,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 07:01:25,763 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:25,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1423510613, now seen corresponding path program 2 times [2023-01-28 07:01:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773028687] [2023-01-28 07:01:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:27,030 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 07:01:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773028687] [2023-01-28 07:01:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773028687] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:01:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486944338] [2023-01-28 07:01:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:27,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:01:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:01:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:01:27,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 07:01:27,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 350 flow. Second operand has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 07:01:27,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:27,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 07:01:27,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:27,230 INFO L130 PetriNetUnfolder]: 121/262 cut-off events. [2023-01-28 07:01:27,230 INFO L131 PetriNetUnfolder]: For 1226/1226 co-relation queries the response was YES. [2023-01-28 07:01:27,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 262 events. 121/262 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 894 event pairs, 20 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 1258. Up to 77 conditions per place. [2023-01-28 07:01:27,232 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 35 selfloop transitions, 4 changer transitions 31/72 dead transitions. [2023-01-28 07:01:27,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 637 flow [2023-01-28 07:01:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:01:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:01:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 530 transitions. [2023-01-28 07:01:27,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.439469320066335 [2023-01-28 07:01:27,234 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 530 transitions. [2023-01-28 07:01:27,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 530 transitions. [2023-01-28 07:01:27,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:27,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 530 transitions. [2023-01-28 07:01:27,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 07:01:27,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:27,237 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:27,237 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 350 flow. Second operand 6 states and 530 transitions. [2023-01-28 07:01:27,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 637 flow [2023-01-28 07:01:27,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 596 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:27,240 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 252 flow [2023-01-28 07:01:27,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-01-28 07:01:27,240 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-01-28 07:01:27,240 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 252 flow [2023-01-28 07:01:27,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 07:01:27,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:27,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:27,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 07:01:27,241 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:01:27,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:27,241 INFO L85 PathProgramCache]: Analyzing trace with hash 746795885, now seen corresponding path program 3 times [2023-01-28 07:01:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154544540] [2023-01-28 07:01:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:01:27,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:01:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:01:27,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:01:27,350 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:01:27,351 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 07:01:27,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 07:01:27,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 07:01:27,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 07:01:27,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 07:01:27,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 07:01:27,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 07:01:27,353 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:27,357 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:01:27,357 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:01:27,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:01:27 BasicIcfg [2023-01-28 07:01:27,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:01:27,414 INFO L158 Benchmark]: Toolchain (without parser) took 17986.22ms. Allocated memory was 539.0MB in the beginning and 1.3GB in the end (delta: 723.5MB). Free memory was 496.1MB in the beginning and 1.1GB in the end (delta: -598.3MB). Peak memory consumption was 125.5MB. Max. memory is 16.0GB. [2023-01-28 07:01:27,414 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 358.6MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:01:27,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.91ms. Allocated memory is still 539.0MB. Free memory was 495.8MB in the beginning and 472.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 07:01:27,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 539.0MB. Free memory was 472.7MB in the beginning and 470.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:01:27,414 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 539.0MB. Free memory was 470.0MB in the beginning and 468.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:01:27,415 INFO L158 Benchmark]: RCFGBuilder took 733.09ms. Allocated memory is still 539.0MB. Free memory was 467.9MB in the beginning and 492.4MB in the end (delta: -24.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 07:01:27,415 INFO L158 Benchmark]: TraceAbstraction took 16767.75ms. Allocated memory was 539.0MB in the beginning and 1.3GB in the end (delta: 723.5MB). Free memory was 491.2MB in the beginning and 1.1GB in the end (delta: -603.2MB). Peak memory consumption was 119.2MB. Max. memory is 16.0GB. [2023-01-28 07:01:27,416 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 358.6MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 389.91ms. Allocated memory is still 539.0MB. Free memory was 495.8MB in the beginning and 472.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 539.0MB. Free memory was 472.7MB in the beginning and 470.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 539.0MB. Free memory was 470.0MB in the beginning and 468.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 733.09ms. Allocated memory is still 539.0MB. Free memory was 467.9MB in the beginning and 492.4MB in the end (delta: -24.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 16767.75ms. Allocated memory was 539.0MB in the beginning and 1.3GB in the end (delta: 723.5MB). Free memory was 491.2MB in the beginning and 1.1GB in the end (delta: -603.2MB). Peak memory consumption was 119.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4735 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2327, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1065, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2327, independent: 1147, independent conditional: 0, independent unconditional: 1147, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1065, unknown conditional: 0, unknown unconditional: 1065] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [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$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 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) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 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_p2_EAX=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=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 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) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 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 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 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_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 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 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3: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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 821]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 33 mSDtfsCounter, 1381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1844occurred in iteration=7, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 3691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 07:01:27,451 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...