/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:39:36,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:39:36,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:39:36,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:39:36,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:39:36,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:39:36,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:39:36,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:39:36,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:39:36,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:39:36,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:39:36,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:39:36,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:39:36,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:39:36,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:39:36,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:39:36,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:39:36,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:39:36,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:39:36,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:39:36,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:39:36,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:39:36,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:39:36,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:39:36,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:39:36,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:39:36,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:39:36,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:39:36,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:39:36,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:39:36,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:39:36,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:39:36,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:39:36,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:39:36,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:39:36,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:39:36,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:39:36,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:39:36,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:39:36,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:39:36,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:39:36,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:39:36,984 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:39:36,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:39:36,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:39:36,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:39:36,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:39:36,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:39:36,986 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:39:36,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:39:36,986 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:39:36,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:39:36,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:39:36,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:39:36,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:39:36,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:39:36,989 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:39:36,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:39:36,989 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:39:37,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:39:37,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:39:37,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:39:37,196 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:39:37,197 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:39:37,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-01-28 00:39:38,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:39:38,348 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:39:38,348 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-01-28 00:39:38,361 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de7d061d/b9affff7991144a5b604c98a13c3d1ce/FLAG596644539 [2023-01-28 00:39:38,370 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de7d061d/b9affff7991144a5b604c98a13c3d1ce [2023-01-28 00:39:38,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:39:38,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:39:38,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:39:38,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:39:38,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:39:38,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c140538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38, skipping insertion in model container [2023-01-28 00:39:38,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:39:38,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:39:38,520 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/mix026_power.opt_tso.opt.i[1001,1014] [2023-01-28 00:39:38,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:39:38,705 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:39:38,712 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/mix026_power.opt_tso.opt.i[1001,1014] [2023-01-28 00:39:38,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:39:38,774 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:39:38,774 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:39:38,779 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:39:38,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38 WrapperNode [2023-01-28 00:39:38,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:39:38,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:39:38,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:39:38,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:39:38,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,836 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 00:39:38,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:39:38,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:39:38,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:39:38,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:39:38,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,862 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:39:38,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:39:38,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:39:38,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:39:38,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (1/1) ... [2023-01-28 00:39:38,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:39:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:39:38,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:39:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:39:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:39:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:39:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:39:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:39:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:39:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:39:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:39:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:39:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:39:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:39:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:39:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:39:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:39:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:39:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:39:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:39:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:39:38,945 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:39:39,066 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:39:39,084 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:39:39,343 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:39:39,466 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:39:39,466 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:39:39,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:39:39 BoogieIcfgContainer [2023-01-28 00:39:39,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:39:39,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:39:39,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:39:39,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:39:39,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:39:38" (1/3) ... [2023-01-28 00:39:39,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593c7a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:39:39, skipping insertion in model container [2023-01-28 00:39:39,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:39:38" (2/3) ... [2023-01-28 00:39:39,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593c7a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:39:39, skipping insertion in model container [2023-01-28 00:39:39,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:39:39" (3/3) ... [2023-01-28 00:39:39,474 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-01-28 00:39:39,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:39:39,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:39:39,486 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:39:39,542 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:39:39,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-01-28 00:39:39,631 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-01-28 00:39:39,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:39:39,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-28 00:39:39,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-01-28 00:39:39,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-01-28 00:39:39,643 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:39:39,659 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-01-28 00:39:39,662 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-01-28 00:39:39,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-01-28 00:39:39,693 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-01-28 00:39:39,693 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:39:39,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-28 00:39:39,696 INFO L119 LiptonReduction]: Number of co-enabled transitions 3000 [2023-01-28 00:39:42,891 INFO L134 LiptonReduction]: Checked pairs total: 7767 [2023-01-28 00:39:42,891 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-01-28 00:39:42,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:39:42,913 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;@3cd8ea55, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:39:42,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:39:42,915 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-28 00:39:42,916 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:39:42,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:42,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 00:39:42,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:42,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash 514990672, now seen corresponding path program 1 times [2023-01-28 00:39:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798564070] [2023-01-28 00:39:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798564070] [2023-01-28 00:39:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798564070] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:43,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:39:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110554354] [2023-01-28 00:39:43,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:43,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:39:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:43,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:39:43,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:39:43,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-01-28 00:39:43,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:43,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:43,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-01-28 00:39:43,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:43,879 INFO L130 PetriNetUnfolder]: 3927/5792 cut-off events. [2023-01-28 00:39:43,880 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-01-28 00:39:43,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 5792 events. 3927/5792 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32920 event pairs, 717 based on Foata normal form. 0/5464 useless extension candidates. Maximal degree in co-relation 11332. Up to 4291 conditions per place. [2023-01-28 00:39:43,911 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-01-28 00:39:43,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 190 flow [2023-01-28 00:39:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:39:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:39:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-01-28 00:39:43,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443037974683544 [2023-01-28 00:39:43,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-01-28 00:39:43,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-01-28 00:39:43,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:43,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-01-28 00:39:43,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:43,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:43,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:43,939 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 387 transitions. [2023-01-28 00:39:43,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 190 flow [2023-01-28 00:39:43,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:39:43,944 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-01-28 00:39:43,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 00:39:43,948 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-01-28 00:39:43,948 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-01-28 00:39:43,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:43,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:43,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:43,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:39:43,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:43,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2000565703, now seen corresponding path program 1 times [2023-01-28 00:39:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052266381] [2023-01-28 00:39:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:44,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052266381] [2023-01-28 00:39:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052266381] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:39:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81002282] [2023-01-28 00:39:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:44,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:39:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:39:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:39:44,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-01-28 00:39:44,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:44,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:44,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-01-28 00:39:44,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:45,265 INFO L130 PetriNetUnfolder]: 11225/15342 cut-off events. [2023-01-28 00:39:45,266 INFO L131 PetriNetUnfolder]: For 792/792 co-relation queries the response was YES. [2023-01-28 00:39:45,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31828 conditions, 15342 events. 11225/15342 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 77111 event pairs, 3963 based on Foata normal form. 368/15710 useless extension candidates. Maximal degree in co-relation 31818. Up to 10655 conditions per place. [2023-01-28 00:39:45,339 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-01-28 00:39:45,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 224 flow [2023-01-28 00:39:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:39:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:39:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-01-28 00:39:45,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161744022503516 [2023-01-28 00:39:45,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-01-28 00:39:45,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-01-28 00:39:45,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:45,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-01-28 00:39:45,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,343 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 367 transitions. [2023-01-28 00:39:45,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 224 flow [2023-01-28 00:39:45,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:45,345 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-01-28 00:39:45,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-01-28 00:39:45,345 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-01-28 00:39:45,346 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-01-28 00:39:45,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:45,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:45,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:39:45,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:45,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1887992981, now seen corresponding path program 1 times [2023-01-28 00:39:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:45,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461177036] [2023-01-28 00:39:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:45,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461177036] [2023-01-28 00:39:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461177036] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:39:45,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512730074] [2023-01-28 00:39:45,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:45,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:45,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:45,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-01-28 00:39:45,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:45,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:45,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-01-28 00:39:45,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:46,452 INFO L130 PetriNetUnfolder]: 10397/14226 cut-off events. [2023-01-28 00:39:46,452 INFO L131 PetriNetUnfolder]: For 4696/4696 co-relation queries the response was YES. [2023-01-28 00:39:46,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34718 conditions, 14226 events. 10397/14226 cut-off events. For 4696/4696 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 69493 event pairs, 2875 based on Foata normal form. 180/14406 useless extension candidates. Maximal degree in co-relation 34706. Up to 6993 conditions per place. [2023-01-28 00:39:46,507 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 52 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-01-28 00:39:46,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 302 flow [2023-01-28 00:39:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-01-28 00:39:46,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010548523206751 [2023-01-28 00:39:46,509 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-01-28 00:39:46,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-01-28 00:39:46,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:46,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-01-28 00:39:46,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:46,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:46,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:46,512 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 4 states and 475 transitions. [2023-01-28 00:39:46,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 302 flow [2023-01-28 00:39:46,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:46,534 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 150 flow [2023-01-28 00:39:46,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-01-28 00:39:46,535 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-01-28 00:39:46,538 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 150 flow [2023-01-28 00:39:46,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:46,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:46,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:46,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:39:46,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:46,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1640365980, now seen corresponding path program 1 times [2023-01-28 00:39:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:46,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775861301] [2023-01-28 00:39:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:46,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:46,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775861301] [2023-01-28 00:39:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775861301] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:46,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:46,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494289376] [2023-01-28 00:39:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:46,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-28 00:39:46,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:46,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:46,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-28 00:39:46,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:47,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 92#L845true]) [2023-01-28 00:39:47,238 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 00:39:47,238 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:47,238 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:47,238 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:47,300 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 92#L845true]) [2023-01-28 00:39:47,300 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,301 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,303 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,303 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 125#L838true, P2Thread1of1ForFork2InUse, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-01-28 00:39:47,305 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,305 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,305 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,305 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 34#L880true, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true]) [2023-01-28 00:39:47,306 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,306 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,306 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,306 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:47,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 125#L838true, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-01-28 00:39:47,404 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 34#L880true, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true]) [2023-01-28 00:39:47,404 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 00:39:47,468 INFO L130 PetriNetUnfolder]: 6601/9746 cut-off events. [2023-01-28 00:39:47,469 INFO L131 PetriNetUnfolder]: For 3313/3508 co-relation queries the response was YES. [2023-01-28 00:39:47,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22749 conditions, 9746 events. 6601/9746 cut-off events. For 3313/3508 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 58644 event pairs, 1159 based on Foata normal form. 756/10152 useless extension candidates. Maximal degree in co-relation 22734. Up to 6185 conditions per place. [2023-01-28 00:39:47,526 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 68 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2023-01-28 00:39:47,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 464 flow [2023-01-28 00:39:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:39:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:39:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-01-28 00:39:47,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130801687763713 [2023-01-28 00:39:47,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-01-28 00:39:47,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-01-28 00:39:47,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:47,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-01-28 00:39:47,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,531 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,531 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 150 flow. Second operand 5 states and 608 transitions. [2023-01-28 00:39:47,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 464 flow [2023-01-28 00:39:47,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:47,536 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 222 flow [2023-01-28 00:39:47,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-01-28 00:39:47,537 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-01-28 00:39:47,537 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 222 flow [2023-01-28 00:39:47,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:47,537 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 00:39:47,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:39:47,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:47,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1961984327, now seen corresponding path program 1 times [2023-01-28 00:39:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604874935] [2023-01-28 00:39:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604874935] [2023-01-28 00:39:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604874935] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:39:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931482418] [2023-01-28 00:39:47,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:47,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:39:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:39:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:39:47,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-28 00:39:47,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:47,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:47,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-28 00:39:47,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:48,312 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][75], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, Black: 164#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 180#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 92#L845true]) [2023-01-28 00:39:48,313 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 00:39:48,313 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:48,313 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:48,313 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 00:39:48,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, Black: 164#(= ~__unbuffered_cnt~0 0), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork1InUse, 43#P2EXITtrue, Black: 167#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 176#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 92#L845true]) [2023-01-28 00:39:48,355 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-28 00:39:48,355 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:48,355 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:48,355 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 00:39:48,418 INFO L130 PetriNetUnfolder]: 5285/8056 cut-off events. [2023-01-28 00:39:48,418 INFO L131 PetriNetUnfolder]: For 5462/5547 co-relation queries the response was YES. [2023-01-28 00:39:48,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24226 conditions, 8056 events. 5285/8056 cut-off events. For 5462/5547 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 49612 event pairs, 557 based on Foata normal form. 503/8327 useless extension candidates. Maximal degree in co-relation 24207. Up to 2549 conditions per place. [2023-01-28 00:39:48,446 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 93 selfloop transitions, 19 changer transitions 1/123 dead transitions. [2023-01-28 00:39:48,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 123 transitions, 744 flow [2023-01-28 00:39:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-01-28 00:39:48,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141651597347799 [2023-01-28 00:39:48,448 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-01-28 00:39:48,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-01-28 00:39:48,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:48,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-01-28 00:39:48,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:48,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:48,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:48,453 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 222 flow. Second operand 7 states and 853 transitions. [2023-01-28 00:39:48,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 123 transitions, 744 flow [2023-01-28 00:39:48,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 123 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:48,471 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 351 flow [2023-01-28 00:39:48,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-01-28 00:39:48,472 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-01-28 00:39:48,472 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 351 flow [2023-01-28 00:39:48,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:48,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:48,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:48,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:39:48,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:48,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1254189260, now seen corresponding path program 1 times [2023-01-28 00:39:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381832933] [2023-01-28 00:39:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:48,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381832933] [2023-01-28 00:39:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381832933] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:48,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144624294] [2023-01-28 00:39:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:48,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:48,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:48,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-01-28 00:39:48,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:48,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:48,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-01-28 00:39:48,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:49,530 INFO L130 PetriNetUnfolder]: 8910/13038 cut-off events. [2023-01-28 00:39:49,530 INFO L131 PetriNetUnfolder]: For 30654/30654 co-relation queries the response was YES. [2023-01-28 00:39:49,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48968 conditions, 13038 events. 8910/13038 cut-off events. For 30654/30654 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 75076 event pairs, 972 based on Foata normal form. 65/13103 useless extension candidates. Maximal degree in co-relation 48945. Up to 6108 conditions per place. [2023-01-28 00:39:49,576 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 107 selfloop transitions, 21 changer transitions 36/164 dead transitions. [2023-01-28 00:39:49,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 164 transitions, 1397 flow [2023-01-28 00:39:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:39:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:39:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-01-28 00:39:49,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130801687763713 [2023-01-28 00:39:49,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-01-28 00:39:49,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-01-28 00:39:49,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:49,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-01-28 00:39:49,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,581 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 351 flow. Second operand 5 states and 608 transitions. [2023-01-28 00:39:49,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 164 transitions, 1397 flow [2023-01-28 00:39:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 164 transitions, 1225 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:49,975 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 389 flow [2023-01-28 00:39:49,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-01-28 00:39:49,976 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-01-28 00:39:49,976 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 389 flow [2023-01-28 00:39:49,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:49,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:49,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:49,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:39:49,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:49,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash -912923184, now seen corresponding path program 2 times [2023-01-28 00:39:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790934008] [2023-01-28 00:39:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790934008] [2023-01-28 00:39:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790934008] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:50,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:50,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670302810] [2023-01-28 00:39:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:50,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:50,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-01-28 00:39:50,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:50,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-01-28 00:39:50,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:50,794 INFO L130 PetriNetUnfolder]: 4414/6990 cut-off events. [2023-01-28 00:39:50,794 INFO L131 PetriNetUnfolder]: For 15064/15243 co-relation queries the response was YES. [2023-01-28 00:39:50,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25996 conditions, 6990 events. 4414/6990 cut-off events. For 15064/15243 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 41835 event pairs, 944 based on Foata normal form. 105/6962 useless extension candidates. Maximal degree in co-relation 25970. Up to 3553 conditions per place. [2023-01-28 00:39:50,823 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 70 selfloop transitions, 4 changer transitions 12/101 dead transitions. [2023-01-28 00:39:50,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 801 flow [2023-01-28 00:39:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-01-28 00:39:50,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274261603375527 [2023-01-28 00:39:50,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-01-28 00:39:50,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-01-28 00:39:50,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:50,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-01-28 00:39:50,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,827 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 389 flow. Second operand 4 states and 500 transitions. [2023-01-28 00:39:50,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 801 flow [2023-01-28 00:39:50,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 761 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:50,862 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 387 flow [2023-01-28 00:39:50,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-01-28 00:39:50,862 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-01-28 00:39:50,862 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 387 flow [2023-01-28 00:39:50,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:50,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:50,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:50,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:39:50,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:50,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1010824901, now seen corresponding path program 1 times [2023-01-28 00:39:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055963147] [2023-01-28 00:39:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055963147] [2023-01-28 00:39:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055963147] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:51,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443861632] [2023-01-28 00:39:51,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:51,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:39:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:39:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:39:51,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-28 00:39:51,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:51,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:51,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-28 00:39:51,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:51,536 INFO L130 PetriNetUnfolder]: 3529/5649 cut-off events. [2023-01-28 00:39:51,536 INFO L131 PetriNetUnfolder]: For 9273/9380 co-relation queries the response was YES. [2023-01-28 00:39:51,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19234 conditions, 5649 events. 3529/5649 cut-off events. For 9273/9380 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 34128 event pairs, 553 based on Foata normal form. 373/5912 useless extension candidates. Maximal degree in co-relation 19209. Up to 1794 conditions per place. [2023-01-28 00:39:51,560 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 93 selfloop transitions, 18 changer transitions 17/147 dead transitions. [2023-01-28 00:39:51,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 147 transitions, 1147 flow [2023-01-28 00:39:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-01-28 00:39:51,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147679324894515 [2023-01-28 00:39:51,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-01-28 00:39:51,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-01-28 00:39:51,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:51,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-01-28 00:39:51,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:51,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:51,566 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:51,566 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 387 flow. Second operand 7 states and 854 transitions. [2023-01-28 00:39:51,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 147 transitions, 1147 flow [2023-01-28 00:39:51,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 1116 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:51,579 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 512 flow [2023-01-28 00:39:51,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2023-01-28 00:39:51,580 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-01-28 00:39:51,580 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 512 flow [2023-01-28 00:39:51,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:51,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:51,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:51,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:39:51,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:51,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1470582725, now seen corresponding path program 1 times [2023-01-28 00:39:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285418900] [2023-01-28 00:39:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285418900] [2023-01-28 00:39:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285418900] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10186219] [2023-01-28 00:39:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:51,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:51,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-01-28 00:39:51,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:51,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:51,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-01-28 00:39:51,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:52,444 INFO L130 PetriNetUnfolder]: 5516/8455 cut-off events. [2023-01-28 00:39:52,444 INFO L131 PetriNetUnfolder]: For 26461/26461 co-relation queries the response was YES. [2023-01-28 00:39:52,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35090 conditions, 8455 events. 5516/8455 cut-off events. For 26461/26461 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 48326 event pairs, 573 based on Foata normal form. 12/8467 useless extension candidates. Maximal degree in co-relation 35062. Up to 3927 conditions per place. [2023-01-28 00:39:52,476 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 100 selfloop transitions, 24 changer transitions 24/148 dead transitions. [2023-01-28 00:39:52,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 148 transitions, 1414 flow [2023-01-28 00:39:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:39:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:39:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-01-28 00:39:52,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49873417721518987 [2023-01-28 00:39:52,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-01-28 00:39:52,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-01-28 00:39:52,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:52,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-01-28 00:39:52,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,481 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,481 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 512 flow. Second operand 5 states and 591 transitions. [2023-01-28 00:39:52,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 148 transitions, 1414 flow [2023-01-28 00:39:52,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 148 transitions, 1236 flow, removed 72 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:52,637 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 608 flow [2023-01-28 00:39:52,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2023-01-28 00:39:52,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-01-28 00:39:52,637 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 608 flow [2023-01-28 00:39:52,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:52,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:52,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:52,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:39:52,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:52,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 586013674, now seen corresponding path program 1 times [2023-01-28 00:39:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112142688] [2023-01-28 00:39:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112142688] [2023-01-28 00:39:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112142688] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:53,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:53,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:39:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413345740] [2023-01-28 00:39:53,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:53,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:39:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:39:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:39:53,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-28 00:39:53,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:53,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:53,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-28 00:39:53,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:53,710 INFO L130 PetriNetUnfolder]: 4277/7110 cut-off events. [2023-01-28 00:39:53,711 INFO L131 PetriNetUnfolder]: For 18336/18475 co-relation queries the response was YES. [2023-01-28 00:39:53,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27437 conditions, 7110 events. 4277/7110 cut-off events. For 18336/18475 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47207 event pairs, 656 based on Foata normal form. 40/7030 useless extension candidates. Maximal degree in co-relation 27405. Up to 3345 conditions per place. [2023-01-28 00:39:53,738 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 102 selfloop transitions, 9 changer transitions 56/192 dead transitions. [2023-01-28 00:39:53,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 192 transitions, 1740 flow [2023-01-28 00:39:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-01-28 00:39:53,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057263411693791 [2023-01-28 00:39:53,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-01-28 00:39:53,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-01-28 00:39:53,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:53,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-01-28 00:39:53,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:53,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:53,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:53,746 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 608 flow. Second operand 7 states and 839 transitions. [2023-01-28 00:39:53,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 192 transitions, 1740 flow [2023-01-28 00:39:53,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 192 transitions, 1700 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-01-28 00:39:53,852 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 655 flow [2023-01-28 00:39:53,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=655, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-01-28 00:39:53,853 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2023-01-28 00:39:53,853 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 655 flow [2023-01-28 00:39:53,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:53,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:53,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:53,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:39:53,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:53,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1711134967, now seen corresponding path program 1 times [2023-01-28 00:39:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280894190] [2023-01-28 00:39:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:54,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280894190] [2023-01-28 00:39:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280894190] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:54,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:54,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:54,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407679597] [2023-01-28 00:39:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:54,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:54,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-01-28 00:39:54,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 655 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:54,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-01-28 00:39:54,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:54,810 INFO L130 PetriNetUnfolder]: 6395/10100 cut-off events. [2023-01-28 00:39:54,810 INFO L131 PetriNetUnfolder]: For 32409/32409 co-relation queries the response was YES. [2023-01-28 00:39:54,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44254 conditions, 10100 events. 6395/10100 cut-off events. For 32409/32409 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 62865 event pairs, 1597 based on Foata normal form. 14/10114 useless extension candidates. Maximal degree in co-relation 44220. Up to 5470 conditions per place. [2023-01-28 00:39:54,842 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 87 selfloop transitions, 19 changer transitions 27/133 dead transitions. [2023-01-28 00:39:54,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 133 transitions, 1294 flow [2023-01-28 00:39:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-01-28 00:39:54,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052742616033755 [2023-01-28 00:39:54,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-01-28 00:39:54,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-01-28 00:39:54,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:54,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-01-28 00:39:54,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,846 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:54,846 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 655 flow. Second operand 4 states and 479 transitions. [2023-01-28 00:39:54,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 133 transitions, 1294 flow [2023-01-28 00:39:55,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 133 transitions, 1287 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:55,043 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 649 flow [2023-01-28 00:39:55,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-01-28 00:39:55,044 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-01-28 00:39:55,044 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 649 flow [2023-01-28 00:39:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:55,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:55,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:55,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:39:55,044 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:55,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -806853754, now seen corresponding path program 2 times [2023-01-28 00:39:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820943837] [2023-01-28 00:39:55,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820943837] [2023-01-28 00:39:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820943837] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206115885] [2023-01-28 00:39:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:55,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:39:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:39:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:39:55,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 237 [2023-01-28 00:39:55,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 649 flow. Second operand has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:55,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:55,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 237 [2023-01-28 00:39:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:56,820 INFO L130 PetriNetUnfolder]: 7371/12042 cut-off events. [2023-01-28 00:39:56,820 INFO L131 PetriNetUnfolder]: For 42896/42896 co-relation queries the response was YES. [2023-01-28 00:39:56,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53169 conditions, 12042 events. 7371/12042 cut-off events. For 42896/42896 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 82069 event pairs, 754 based on Foata normal form. 10/12052 useless extension candidates. Maximal degree in co-relation 53133. Up to 5036 conditions per place. [2023-01-28 00:39:56,878 INFO L137 encePairwiseOnDemand]: 224/237 looper letters, 198 selfloop transitions, 55 changer transitions 49/302 dead transitions. [2023-01-28 00:39:56,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 302 transitions, 2936 flow [2023-01-28 00:39:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:39:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:39:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1039 transitions. [2023-01-28 00:39:56,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487107360525082 [2023-01-28 00:39:56,881 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1039 transitions. [2023-01-28 00:39:56,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1039 transitions. [2023-01-28 00:39:56,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:56,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1039 transitions. [2023-01-28 00:39:56,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:56,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:56,886 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:56,886 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 649 flow. Second operand 9 states and 1039 transitions. [2023-01-28 00:39:56,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 302 transitions, 2936 flow [2023-01-28 00:39:57,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 302 transitions, 2908 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-01-28 00:39:57,216 INFO L231 Difference]: Finished difference. Result has 87 places, 110 transitions, 1279 flow [2023-01-28 00:39:57,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=87, PETRI_TRANSITIONS=110} [2023-01-28 00:39:57,217 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-01-28 00:39:57,217 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 110 transitions, 1279 flow [2023-01-28 00:39:57,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:57,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:57,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:39:57,217 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:57,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2123183322, now seen corresponding path program 3 times [2023-01-28 00:39:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794784061] [2023-01-28 00:39:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:39:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794784061] [2023-01-28 00:39:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794784061] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:57,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:39:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806601354] [2023-01-28 00:39:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:57,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:39:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:39:57,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:39:57,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-01-28 00:39:57,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 110 transitions, 1279 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:57,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:57,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-01-28 00:39:57,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:58,351 INFO L130 PetriNetUnfolder]: 5190/8801 cut-off events. [2023-01-28 00:39:58,352 INFO L131 PetriNetUnfolder]: For 36280/37000 co-relation queries the response was YES. [2023-01-28 00:39:58,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39455 conditions, 8801 events. 5190/8801 cut-off events. For 36280/37000 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 63869 event pairs, 407 based on Foata normal form. 371/8961 useless extension candidates. Maximal degree in co-relation 39413. Up to 3247 conditions per place. [2023-01-28 00:39:58,394 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 86 selfloop transitions, 17 changer transitions 124/239 dead transitions. [2023-01-28 00:39:58,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 239 transitions, 3013 flow [2023-01-28 00:39:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:39:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:39:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 950 transitions. [2023-01-28 00:39:58,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010548523206751 [2023-01-28 00:39:58,396 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 950 transitions. [2023-01-28 00:39:58,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 950 transitions. [2023-01-28 00:39:58,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:58,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 950 transitions. [2023-01-28 00:39:58,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:58,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:58,400 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:58,400 INFO L175 Difference]: Start difference. First operand has 87 places, 110 transitions, 1279 flow. Second operand 8 states and 950 transitions. [2023-01-28 00:39:58,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 239 transitions, 3013 flow [2023-01-28 00:39:58,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 239 transitions, 2945 flow, removed 32 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:58,893 INFO L231 Difference]: Finished difference. Result has 96 places, 65 transitions, 594 flow [2023-01-28 00:39:58,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=96, PETRI_TRANSITIONS=65} [2023-01-28 00:39:58,893 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2023-01-28 00:39:58,893 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 65 transitions, 594 flow [2023-01-28 00:39:58,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:58,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:58,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:58,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:39:58,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:58,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1671840729, now seen corresponding path program 1 times [2023-01-28 00:39:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405383706] [2023-01-28 00:39:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:39:58,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:39:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:39:58,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:39:58,971 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:39:58,971 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:39:58,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:39:58,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:39:58,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:39:58,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:39:58,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:39:58,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:39:58,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:39:58,974 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:58,977 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:39:58,978 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:39:59,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:39:59 BasicIcfg [2023-01-28 00:39:59,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:39:59,055 INFO L158 Benchmark]: Toolchain (without parser) took 20681.90ms. Allocated memory was 625.0MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 574.6MB in the beginning and 2.3GB in the end (delta: -1.8GB). Peak memory consumption was 131.3MB. Max. memory is 16.0GB. [2023-01-28 00:39:59,055 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 350.2MB. Free memory is still 300.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:39:59,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.16ms. Allocated memory is still 625.0MB. Free memory was 574.2MB in the beginning and 550.8MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:39:59,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.39ms. Allocated memory is still 625.0MB. Free memory was 550.8MB in the beginning and 548.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:39:59,055 INFO L158 Benchmark]: Boogie Preprocessor took 40.61ms. Allocated memory is still 625.0MB. Free memory was 548.3MB in the beginning and 546.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:39:59,055 INFO L158 Benchmark]: RCFGBuilder took 590.02ms. Allocated memory is still 625.0MB. Free memory was 546.2MB in the beginning and 583.1MB in the end (delta: -36.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. [2023-01-28 00:39:59,056 INFO L158 Benchmark]: TraceAbstraction took 19584.65ms. Allocated memory was 625.0MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 583.1MB in the beginning and 2.3GB in the end (delta: -1.7GB). Peak memory consumption was 136.6MB. Max. memory is 16.0GB. [2023-01-28 00:39:59,056 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.08ms. Allocated memory is still 350.2MB. Free memory is still 300.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 406.16ms. Allocated memory is still 625.0MB. Free memory was 574.2MB in the beginning and 550.8MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.39ms. Allocated memory is still 625.0MB. Free memory was 550.8MB in the beginning and 548.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.61ms. Allocated memory is still 625.0MB. Free memory was 548.3MB in the beginning and 546.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 590.02ms. Allocated memory is still 625.0MB. Free memory was 546.2MB in the beginning and 583.1MB in the end (delta: -36.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. * TraceAbstraction took 19584.65ms. Allocated memory was 625.0MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 583.1MB in the beginning and 2.3GB in the end (delta: -1.7GB). Peak memory consumption was 136.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 29 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 7767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3176, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1542, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3176, independent: 1447, independent conditional: 0, independent unconditional: 1447, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1542, unknown conditional: 0, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=0, t685={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=1, t685={6:0}, t686={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=2, t685={6:0}, t686={7:0}, t687={8:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=3, t685={6:0}, t686={7:0}, t687={8:0}, t688={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={6:0}, t686={7:0}, t687={8:0}, t688={5:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 865]: 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: 863]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 557 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 557 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1624 IncrementalHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 44 mSDtfsCounter, 1624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1279occurred in iteration=12, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:39:59,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...