./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 02:26:22,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:26:22,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:26:22,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:26:22,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:26:22,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:26:22,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:26:22,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:26:22,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:26:22,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:26:22,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:26:22,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:26:22,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:26:22,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:26:22,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:26:22,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:26:22,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:26:22,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:26:22,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:26:22,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:26:22,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:26:22,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:26:22,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:26:22,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:26:22,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:26:22,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:26:22,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:26:22,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:26:22,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:26:22,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:26:22,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:26:22,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:26:22,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:26:22,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:26:22,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:26:22,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:26:22,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:26:22,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:26:22,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:26:22,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:26:22,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:26:22,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 02:26:22,711 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:26:22,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:26:22,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:26:22,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:26:22,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:26:22,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:26:22,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:26:22,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:26:22,714 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:26:22,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:26:22,715 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:26:22,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 02:26:22,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:26:22,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:26:22,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:26:22,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:26:22,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:26:22,716 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:26:22,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:26:22,716 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:26:22,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:26:22,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:26:22,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:26:22,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:26:22,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:26:22,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:26:22,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:26:22,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:26:22,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:26:22,718 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 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 -> TOGETHER [2023-08-31 02:26:22,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:26:22,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:26:22,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:26:22,965 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:26:22,965 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:26:22,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-31 02:26:23,986 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:26:24,165 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:26:24,165 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-31 02:26:24,169 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e39cce5/3d6b67bf1889491ab5b0c95f975701c0/FLAG55389737e [2023-08-31 02:26:24,178 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e39cce5/3d6b67bf1889491ab5b0c95f975701c0 [2023-08-31 02:26:24,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:26:24,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:26:24,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:26:24,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:26:24,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:26:24,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a28f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24, skipping insertion in model container [2023-08-31 02:26:24,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:26:24,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:26:24,297 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-31 02:26:24,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:26:24,307 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:26:24,324 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-31 02:26:24,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:26:24,330 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:26:24,330 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:26:24,334 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:26:24,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24 WrapperNode [2023-08-31 02:26:24,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:26:24,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:26:24,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:26:24,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:26:24,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,379 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 347 [2023-08-31 02:26:24,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:26:24,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:26:24,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:26:24,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:26:24,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,430 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:26:24,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:26:24,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:26:24,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:26:24,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (1/1) ... [2023-08-31 02:26:24,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:26:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:26:24,476 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-08-31 02:26:24,483 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-08-31 02:26:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:26:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:26:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 02:26:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 02:26:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:26:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:26:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:26:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:26:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:26:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:26:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 02:26:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:26:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:26:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 02:26:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:26:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:26:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:26:24,508 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:26:24,595 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:26:24,597 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:26:25,013 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:26:25,212 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:26:25,212 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-31 02:26:25,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:26:25 BoogieIcfgContainer [2023-08-31 02:26:25,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:26:25,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:26:25,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:26:25,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:26:25,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:26:24" (1/3) ... [2023-08-31 02:26:25,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b4b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:26:25, skipping insertion in model container [2023-08-31 02:26:25,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:26:24" (2/3) ... [2023-08-31 02:26:25,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b4b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:26:25, skipping insertion in model container [2023-08-31 02:26:25,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:26:25" (3/3) ... [2023-08-31 02:26:25,235 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-08-31 02:26:25,241 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:26:25,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:26:25,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:26:25,248 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:26:25,350 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 02:26:25,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 248 transitions, 520 flow [2023-08-31 02:26:25,475 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2023-08-31 02:26:25,475 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:26:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 245 events. 19/245 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-08-31 02:26:25,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 248 transitions, 520 flow [2023-08-31 02:26:25,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 235 transitions, 488 flow [2023-08-31 02:26:25,490 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:26:25,506 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 235 transitions, 488 flow [2023-08-31 02:26:25,512 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 235 transitions, 488 flow [2023-08-31 02:26:25,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 235 transitions, 488 flow [2023-08-31 02:26:25,549 INFO L130 PetriNetUnfolder]: 19/235 cut-off events. [2023-08-31 02:26:25,550 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:26:25,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 235 events. 19/235 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 140 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-08-31 02:26:25,553 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 [2023-08-31 02:26:32,698 INFO L134 LiptonReduction]: Checked pairs total: 3005 [2023-08-31 02:26:32,699 INFO L136 LiptonReduction]: Total number of compositions: 247 [2023-08-31 02:26:32,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:26:32,731 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=true, 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;@568a056, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:26:32,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 02:26:32,740 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2023-08-31 02:26:32,740 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:26:32,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:32,743 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-08-31 02:26:32,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:32,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 169519787, now seen corresponding path program 1 times [2023-08-31 02:26:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533265027] [2023-08-31 02:26:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:26:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533265027] [2023-08-31 02:26:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533265027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:26:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890941114] [2023-08-31 02:26:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:33,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:26:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:33,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:26:33,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:26:33,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 495 [2023-08-31 02:26:33,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:33,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:33,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 495 [2023-08-31 02:26:33,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:33,694 INFO L130 PetriNetUnfolder]: 564/838 cut-off events. [2023-08-31 02:26:33,694 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-08-31 02:26:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 838 events. 564/838 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3025 event pairs, 130 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 1134. Up to 602 conditions per place. [2023-08-31 02:26:33,702 INFO L137 encePairwiseOnDemand]: 485/495 looper letters, 57 selfloop transitions, 12 changer transitions 2/71 dead transitions. [2023-08-31 02:26:33,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 335 flow [2023-08-31 02:26:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:26:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:26:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 885 transitions. [2023-08-31 02:26:33,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2023-08-31 02:26:33,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 885 transitions. [2023-08-31 02:26:33,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 885 transitions. [2023-08-31 02:26:33,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:33,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 885 transitions. [2023-08-31 02:26:33,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:33,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:33,738 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:33,740 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 4 states and 885 transitions. [2023-08-31 02:26:33,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 335 flow [2023-08-31 02:26:33,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 301 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 02:26:33,746 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 149 flow [2023-08-31 02:26:33,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2023-08-31 02:26:33,752 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-08-31 02:26:33,753 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 149 flow [2023-08-31 02:26:33,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:33,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:33,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:26:33,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 02:26:33,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:33,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 790486479, now seen corresponding path program 1 times [2023-08-31 02:26:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058744043] [2023-08-31 02:26:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:26:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:33,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058744043] [2023-08-31 02:26:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058744043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:33,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:33,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:26:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410004170] [2023-08-31 02:26:33,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:33,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:26:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:26:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:26:33,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-08-31 02:26:33,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 211.25) internal successors, (845), 4 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:33,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:33,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-08-31 02:26:33,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:34,146 INFO L130 PetriNetUnfolder]: 680/1058 cut-off events. [2023-08-31 02:26:34,146 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-08-31 02:26:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 1058 events. 680/1058 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3978 event pairs, 453 based on Foata normal form. 50/1042 useless extension candidates. Maximal degree in co-relation 1563. Up to 837 conditions per place. [2023-08-31 02:26:34,150 INFO L137 encePairwiseOnDemand]: 489/495 looper letters, 38 selfloop transitions, 2 changer transitions 24/64 dead transitions. [2023-08-31 02:26:34,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 353 flow [2023-08-31 02:26:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:26:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:26:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2023-08-31 02:26:34,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44343434343434346 [2023-08-31 02:26:34,153 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 878 transitions. [2023-08-31 02:26:34,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 878 transitions. [2023-08-31 02:26:34,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:34,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 878 transitions. [2023-08-31 02:26:34,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,158 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,159 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 149 flow. Second operand 4 states and 878 transitions. [2023-08-31 02:26:34,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 353 flow [2023-08-31 02:26:34,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 02:26:34,160 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 159 flow [2023-08-31 02:26:34,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2023-08-31 02:26:34,161 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-31 02:26:34,161 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 159 flow [2023-08-31 02:26:34,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.25) internal successors, (845), 4 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:34,162 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] [2023-08-31 02:26:34,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 02:26:34,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:34,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 611376253, now seen corresponding path program 1 times [2023-08-31 02:26:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744549921] [2023-08-31 02:26:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:26:34,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744549921] [2023-08-31 02:26:34,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744549921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:34,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:34,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:26:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397511638] [2023-08-31 02:26:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:34,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:26:34,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:34,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:26:34,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:26:34,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 495 [2023-08-31 02:26:34,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:34,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 495 [2023-08-31 02:26:34,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:34,421 INFO L130 PetriNetUnfolder]: 623/959 cut-off events. [2023-08-31 02:26:34,421 INFO L131 PetriNetUnfolder]: For 367/367 co-relation queries the response was YES. [2023-08-31 02:26:34,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 959 events. 623/959 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3602 event pairs, 240 based on Foata normal form. 70/1029 useless extension candidates. Maximal degree in co-relation 2439. Up to 512 conditions per place. [2023-08-31 02:26:34,425 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 54 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-31 02:26:34,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 314 flow [2023-08-31 02:26:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:26:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:26:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-08-31 02:26:34,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653198653198653 [2023-08-31 02:26:34,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-08-31 02:26:34,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-08-31 02:26:34,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:34,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-08-31 02:26:34,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,431 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 159 flow. Second operand 3 states and 691 transitions. [2023-08-31 02:26:34,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 314 flow [2023-08-31 02:26:34,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 02:26:34,433 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 157 flow [2023-08-31 02:26:34,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2023-08-31 02:26:34,434 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-31 02:26:34,434 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 157 flow [2023-08-31 02:26:34,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:34,435 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] [2023-08-31 02:26:34,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 02:26:34,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:34,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 654922567, now seen corresponding path program 1 times [2023-08-31 02:26:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233503491] [2023-08-31 02:26:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:26:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233503491] [2023-08-31 02:26:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233503491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:26:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625627662] [2023-08-31 02:26:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:34,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:26:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:34,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:26:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:26:34,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-08-31 02:26:34,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:34,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-08-31 02:26:34,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:34,674 INFO L130 PetriNetUnfolder]: 625/969 cut-off events. [2023-08-31 02:26:34,675 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-08-31 02:26:34,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 969 events. 625/969 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3620 event pairs, 224 based on Foata normal form. 44/1013 useless extension candidates. Maximal degree in co-relation 2152. Up to 520 conditions per place. [2023-08-31 02:26:34,678 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 47 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2023-08-31 02:26:34,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2023-08-31 02:26:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:26:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:26:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-08-31 02:26:34,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707070707070707 [2023-08-31 02:26:34,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-08-31 02:26:34,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-08-31 02:26:34,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:34,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-08-31 02:26:34,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,687 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 157 flow. Second operand 3 states and 699 transitions. [2023-08-31 02:26:34,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2023-08-31 02:26:34,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:26:34,690 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 157 flow [2023-08-31 02:26:34,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-08-31 02:26:34,691 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-08-31 02:26:34,691 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 157 flow [2023-08-31 02:26:34,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:34,692 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-08-31 02:26:34,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 02:26:34,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:34,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1525535317, now seen corresponding path program 1 times [2023-08-31 02:26:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058989924] [2023-08-31 02:26:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:26:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058989924] [2023-08-31 02:26:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058989924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 02:26:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629506355] [2023-08-31 02:26:34,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:34,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:26:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:34,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:26:34,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:26:34,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-08-31 02:26:34,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:34,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:34,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-08-31 02:26:34,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:35,086 INFO L130 PetriNetUnfolder]: 883/1411 cut-off events. [2023-08-31 02:26:35,087 INFO L131 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES. [2023-08-31 02:26:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1411 events. 883/1411 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5924 event pairs, 701 based on Foata normal form. 26/1437 useless extension candidates. Maximal degree in co-relation 2284. Up to 965 conditions per place. [2023-08-31 02:26:35,091 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 34 selfloop transitions, 3 changer transitions 25/62 dead transitions. [2023-08-31 02:26:35,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 361 flow [2023-08-31 02:26:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:26:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:26:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 879 transitions. [2023-08-31 02:26:35,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44393939393939397 [2023-08-31 02:26:35,094 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 879 transitions. [2023-08-31 02:26:35,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 879 transitions. [2023-08-31 02:26:35,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:35,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 879 transitions. [2023-08-31 02:26:35,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.75) internal successors, (879), 4 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,099 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,099 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 157 flow. Second operand 4 states and 879 transitions. [2023-08-31 02:26:35,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 361 flow [2023-08-31 02:26:35,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:26:35,103 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 161 flow [2023-08-31 02:26:35,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-31 02:26:35,104 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-08-31 02:26:35,105 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 161 flow [2023-08-31 02:26:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:35,106 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] [2023-08-31 02:26:35,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 02:26:35,106 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:35,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -424741139, now seen corresponding path program 1 times [2023-08-31 02:26:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607731969] [2023-08-31 02:26:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:26:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607731969] [2023-08-31 02:26:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607731969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 02:26:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955109600] [2023-08-31 02:26:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:35,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:26:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:26:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:26:35,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-08-31 02:26:35,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:35,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-08-31 02:26:35,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:35,368 INFO L130 PetriNetUnfolder]: 634/996 cut-off events. [2023-08-31 02:26:35,369 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-08-31 02:26:35,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2702 conditions, 996 events. 634/996 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3749 event pairs, 505 based on Foata normal form. 18/1014 useless extension candidates. Maximal degree in co-relation 2668. Up to 831 conditions per place. [2023-08-31 02:26:35,372 INFO L137 encePairwiseOnDemand]: 487/495 looper letters, 30 selfloop transitions, 6 changer transitions 17/53 dead transitions. [2023-08-31 02:26:35,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 307 flow [2023-08-31 02:26:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:26:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:26:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1081 transitions. [2023-08-31 02:26:35,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43676767676767675 [2023-08-31 02:26:35,375 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1081 transitions. [2023-08-31 02:26:35,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1081 transitions. [2023-08-31 02:26:35,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:35,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1081 transitions. [2023-08-31 02:26:35,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 216.2) internal successors, (1081), 5 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,380 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 161 flow. Second operand 5 states and 1081 transitions. [2023-08-31 02:26:35,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 307 flow [2023-08-31 02:26:35,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 297 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 02:26:35,382 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 166 flow [2023-08-31 02:26:35,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-31 02:26:35,383 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-31 02:26:35,383 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 166 flow [2023-08-31 02:26:35,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:35,384 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] [2023-08-31 02:26:35,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 02:26:35,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:35,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1608617032, now seen corresponding path program 1 times [2023-08-31 02:26:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132248971] [2023-08-31 02:26:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:26:35,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132248971] [2023-08-31 02:26:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132248971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:35,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:26:35,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327251471] [2023-08-31 02:26:35,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:35,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:26:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:35,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:26:35,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:26:35,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-08-31 02:26:35,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:35,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-08-31 02:26:35,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:35,609 INFO L130 PetriNetUnfolder]: 353/547 cut-off events. [2023-08-31 02:26:35,609 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-08-31 02:26:35,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 547 events. 353/547 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1604 event pairs, 139 based on Foata normal form. 14/561 useless extension candidates. Maximal degree in co-relation 1435. Up to 460 conditions per place. [2023-08-31 02:26:35,612 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 37 selfloop transitions, 2 changer transitions 7/46 dead transitions. [2023-08-31 02:26:35,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 283 flow [2023-08-31 02:26:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:26:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:26:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-08-31 02:26:35,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463973063973064 [2023-08-31 02:26:35,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-08-31 02:26:35,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-08-31 02:26:35,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:35,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-08-31 02:26:35,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,618 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 166 flow. Second operand 3 states and 689 transitions. [2023-08-31 02:26:35,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 283 flow [2023-08-31 02:26:35,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 261 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-31 02:26:35,620 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 158 flow [2023-08-31 02:26:35,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-31 02:26:35,620 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-08-31 02:26:35,620 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 158 flow [2023-08-31 02:26:35,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:35,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:35,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:26:35,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 02:26:35,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:35,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1743219548, now seen corresponding path program 1 times [2023-08-31 02:26:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591695739] [2023-08-31 02:26:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:26:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:35,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591695739] [2023-08-31 02:26:35,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591695739] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:26:35,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893021481] [2023-08-31 02:26:35,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:35,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:26:35,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:26:35,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:26:35,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 02:26:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:36,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 02:26:36,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:26:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:26:36,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:26:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:26:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893021481] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:26:36,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:26:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-31 02:26:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575862148] [2023-08-31 02:26:36,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:26:36,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 02:26:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 02:26:36,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-08-31 02:26:36,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 495 [2023-08-31 02:26:36,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 158 flow. Second operand has 14 states, 14 states have (on average 196.21428571428572) internal successors, (2747), 14 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:36,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:36,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 495 [2023-08-31 02:26:36,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:37,504 INFO L130 PetriNetUnfolder]: 1251/2042 cut-off events. [2023-08-31 02:26:37,504 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2023-08-31 02:26:37,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 2042 events. 1251/2042 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9046 event pairs, 364 based on Foata normal form. 192/2234 useless extension candidates. Maximal degree in co-relation 2554. Up to 483 conditions per place. [2023-08-31 02:26:37,511 INFO L137 encePairwiseOnDemand]: 484/495 looper letters, 78 selfloop transitions, 16 changer transitions 118/212 dead transitions. [2023-08-31 02:26:37,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 212 transitions, 1170 flow [2023-08-31 02:26:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 02:26:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 02:26:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4052 transitions. [2023-08-31 02:26:37,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092929292929293 [2023-08-31 02:26:37,520 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4052 transitions. [2023-08-31 02:26:37,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4052 transitions. [2023-08-31 02:26:37,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:37,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4052 transitions. [2023-08-31 02:26:37,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 202.6) internal successors, (4052), 20 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:37,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:37,538 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:37,538 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 158 flow. Second operand 20 states and 4052 transitions. [2023-08-31 02:26:37,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 212 transitions, 1170 flow [2023-08-31 02:26:37,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 212 transitions, 1157 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-31 02:26:37,541 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 319 flow [2023-08-31 02:26:37,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=319, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-31 02:26:37,542 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-08-31 02:26:37,542 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 319 flow [2023-08-31 02:26:37,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 196.21428571428572) internal successors, (2747), 14 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:37,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:37,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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-08-31 02:26:37,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-31 02:26:37,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:26:37,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:37,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2011379154, now seen corresponding path program 2 times [2023-08-31 02:26:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252659999] [2023-08-31 02:26:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-31 02:26:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252659999] [2023-08-31 02:26:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252659999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:26:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:26:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 02:26:37,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453346122] [2023-08-31 02:26:37,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:26:37,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:26:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:26:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:26:37,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 495 [2023-08-31 02:26:37,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:37,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:37,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 495 [2023-08-31 02:26:37,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:38,285 INFO L130 PetriNetUnfolder]: 2001/3024 cut-off events. [2023-08-31 02:26:38,285 INFO L131 PetriNetUnfolder]: For 9982/9982 co-relation queries the response was YES. [2023-08-31 02:26:38,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11593 conditions, 3024 events. 2001/3024 cut-off events. For 9982/9982 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13309 event pairs, 650 based on Foata normal form. 42/3066 useless extension candidates. Maximal degree in co-relation 6322. Up to 1345 conditions per place. [2023-08-31 02:26:38,303 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 73 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2023-08-31 02:26:38,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 727 flow [2023-08-31 02:26:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:26:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:26:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 922 transitions. [2023-08-31 02:26:38,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46565656565656566 [2023-08-31 02:26:38,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 922 transitions. [2023-08-31 02:26:38,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 922 transitions. [2023-08-31 02:26:38,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:38,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 922 transitions. [2023-08-31 02:26:38,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 230.5) internal successors, (922), 4 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:38,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:38,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:38,310 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 319 flow. Second operand 4 states and 922 transitions. [2023-08-31 02:26:38,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 727 flow [2023-08-31 02:26:38,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 638 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-08-31 02:26:38,361 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 429 flow [2023-08-31 02:26:38,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-31 02:26:38,362 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-08-31 02:26:38,362 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 429 flow [2023-08-31 02:26:38,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:38,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:38,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:26:38,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 02:26:38,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:38,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash -23841826, now seen corresponding path program 1 times [2023-08-31 02:26:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:38,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129259683] [2023-08-31 02:26:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:26:38,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:38,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129259683] [2023-08-31 02:26:38,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129259683] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:26:38,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861586425] [2023-08-31 02:26:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:38,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:26:38,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:26:38,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:26:38,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 02:26:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:38,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 02:26:38,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:26:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:26:38,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:26:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:26:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861586425] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:26:38,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:26:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-31 02:26:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575114597] [2023-08-31 02:26:38,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:26:38,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 02:26:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:26:38,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 02:26:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-31 02:26:39,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 495 [2023-08-31 02:26:39,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 429 flow. Second operand has 12 states, 12 states have (on average 201.83333333333334) internal successors, (2422), 12 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:39,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:26:39,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 495 [2023-08-31 02:26:39,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:26:39,283 INFO L130 PetriNetUnfolder]: 949/1472 cut-off events. [2023-08-31 02:26:39,284 INFO L131 PetriNetUnfolder]: For 4771/4771 co-relation queries the response was YES. [2023-08-31 02:26:39,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1472 events. 949/1472 cut-off events. For 4771/4771 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5597 event pairs, 669 based on Foata normal form. 2/1474 useless extension candidates. Maximal degree in co-relation 5287. Up to 1332 conditions per place. [2023-08-31 02:26:39,291 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 42 selfloop transitions, 3 changer transitions 33/78 dead transitions. [2023-08-31 02:26:39,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 598 flow [2023-08-31 02:26:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:26:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:26:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2023-08-31 02:26:39,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2023-08-31 02:26:39,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1251 transitions. [2023-08-31 02:26:39,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1251 transitions. [2023-08-31 02:26:39,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:26:39,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1251 transitions. [2023-08-31 02:26:39,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:39,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:39,305 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:39,305 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 429 flow. Second operand 6 states and 1251 transitions. [2023-08-31 02:26:39,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 598 flow [2023-08-31 02:26:39,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 560 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-31 02:26:39,313 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 275 flow [2023-08-31 02:26:39,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-08-31 02:26:39,314 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-08-31 02:26:39,315 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 275 flow [2023-08-31 02:26:39,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 201.83333333333334) internal successors, (2422), 12 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:26:39,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:26:39,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:26:39,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-31 02:26:39,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-31 02:26:39,522 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:26:39,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:26:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1711614402, now seen corresponding path program 2 times [2023-08-31 02:26:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:26:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519855573] [2023-08-31 02:26:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:26:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:26:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:26:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:26:42,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:26:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519855573] [2023-08-31 02:26:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519855573] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:26:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468999277] [2023-08-31 02:26:42,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:26:42,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:26:42,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:26:42,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:26:42,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 02:26:43,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:26:43,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:26:43,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-31 02:26:43,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:26:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 02:26:44,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:26:56,608 WARN L222 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:26:58,742 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse7 (* c_~client_back~0 4)) (.cse1 (select .cse2 (+ c_~manager~0.offset (* c_~manager_back~0 4))))) (let ((.cse3 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse8 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse1 (select .cse8 (+ .cse7 ~client~0.offset)))) (= (select .cse8 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse1))))) (.cse0 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse1 (select (select |c_#memory_int| ~client~0.base) (+ .cse7 ~client~0.offset))))))) (let ((.cse5 (and .cse3 .cse0)) (.cse6 (= (mod c_~safe~0 256) 0))) (and (or (let ((.cse4 (= c_~update~0 (select (select |c_#memory_int| c_~node~0.base) (+ (* c_~node_front~0 4) c_~node~0.offset))))) (and (or (and (or .cse0 (= .cse1 (select .cse2 (+ (* 4 c_~manager_front~0) c_~manager~0.offset)))) .cse3) (not .cse4)) (or .cse5 .cse4))) .cse6) (or .cse5 (not .cse6))))))) is different from false [2023-08-31 02:27:49,114 WARN L222 SmtUtils]: Spent 50.22s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:28:42,439 WARN L222 SmtUtils]: Spent 51.04s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:28:42,549 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-08-31 02:28:42,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-08-31 02:28:42,621 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-31 02:28:42,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-08-31 02:28:42,707 INFO L321 Elim1Store]: treesize reduction 48, result has 68.8 percent of original size [2023-08-31 02:28:42,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 117 [2023-08-31 02:28:42,898 INFO L321 Elim1Store]: treesize reduction 266, result has 43.9 percent of original size [2023-08-31 02:28:42,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 127 treesize of output 233 [2023-08-31 02:28:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-08-31 02:28:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468999277] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:28:43,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:28:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 43 [2023-08-31 02:28:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900362033] [2023-08-31 02:28:43,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:28:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-31 02:28:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-31 02:28:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1627, Unknown=3, NotChecked=84, Total=1980 [2023-08-31 02:28:45,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:47,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:49,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:51,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:53,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:55,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:57,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:28:59,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:01,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:03,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:06,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:08,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:10,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:12,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:14,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:16,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:18,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:20,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:22,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:24,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:26,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:28,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:29:28,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 495 [2023-08-31 02:29:28,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 275 flow. Second operand has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:28,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:29:28,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 495 [2023-08-31 02:29:28,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:29:50,329 WARN L222 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:30:22,918 WARN L222 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 117 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:31:21,238 WARN L222 SmtUtils]: Spent 56.23s on a formula simplification. DAG size of input: 83 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:31:23,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:31:25,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:31:27,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:31:29,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:31:31,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:31:33,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:32:11,589 WARN L222 SmtUtils]: Spent 34.20s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:32:23,995 WARN L222 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 105 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:32:56,382 WARN L222 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 98 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:32:58,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:00,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:02,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:04,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:06,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:08,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:10,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:12,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:14,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:16,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:28,907 WARN L222 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 91 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:33:30,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:32,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:34,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:36,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:38,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:33:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:43,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:45,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:47,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:49,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:33:49,661 INFO L130 PetriNetUnfolder]: 1320/2122 cut-off events. [2023-08-31 02:33:49,661 INFO L131 PetriNetUnfolder]: For 3947/3947 co-relation queries the response was YES. [2023-08-31 02:33:49,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 2122 events. 1320/2122 cut-off events. For 3947/3947 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9083 event pairs, 520 based on Foata normal form. 1/2123 useless extension candidates. Maximal degree in co-relation 7062. Up to 1245 conditions per place. [2023-08-31 02:33:49,675 INFO L137 encePairwiseOnDemand]: 477/495 looper letters, 118 selfloop transitions, 62 changer transitions 72/252 dead transitions. [2023-08-31 02:33:49,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 252 transitions, 1526 flow [2023-08-31 02:33:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-31 02:33:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-31 02:33:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 6360 transitions. [2023-08-31 02:33:49,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29201101928374656 [2023-08-31 02:33:49,689 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 6360 transitions. [2023-08-31 02:33:49,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 6360 transitions. [2023-08-31 02:33:49,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:33:49,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 6360 transitions. [2023-08-31 02:33:49,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 144.54545454545453) internal successors, (6360), 44 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:49,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 495.0) internal successors, (22275), 45 states have internal predecessors, (22275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:49,719 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 495.0) internal successors, (22275), 45 states have internal predecessors, (22275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:49,720 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 275 flow. Second operand 44 states and 6360 transitions. [2023-08-31 02:33:49,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 252 transitions, 1526 flow [2023-08-31 02:33:49,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 252 transitions, 1484 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-31 02:33:49,726 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 801 flow [2023-08-31 02:33:49,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=801, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2023-08-31 02:33:49,726 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2023-08-31 02:33:49,726 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 801 flow [2023-08-31 02:33:49,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:49,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:33:49,728 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-08-31 02:33:49,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-31 02:33:49,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:33:49,934 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:33:49,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:33:49,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1225962343, now seen corresponding path program 3 times [2023-08-31 02:33:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:33:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331412129] [2023-08-31 02:33:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:33:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:33:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:33:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:33:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331412129] [2023-08-31 02:33:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331412129] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:33:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476301466] [2023-08-31 02:33:52,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:33:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:33:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:33:52,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:33:52,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 02:33:53,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 02:33:53,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:33:53,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 91 conjunts are in the unsatisfiable core [2023-08-31 02:33:53,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:33:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:33:54,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:34:15,338 WARN L222 SmtUtils]: Spent 20.10s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:35:02,191 WARN L222 SmtUtils]: Spent 44.28s on a formula simplification. DAG size of input: 84 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:35:02,322 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-31 02:35:02,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-08-31 02:35:02,436 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-31 02:35:02,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 127 [2023-08-31 02:35:02,538 INFO L321 Elim1Store]: treesize reduction 48, result has 69.2 percent of original size [2023-08-31 02:35:02,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 119 [2023-08-31 02:35:02,581 INFO L321 Elim1Store]: treesize reduction 153, result has 0.6 percent of original size [2023-08-31 02:35:02,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 1 [2023-08-31 02:35:02,612 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-08-31 02:35:02,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-08-31 02:35:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:35:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476301466] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:35:03,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:35:03,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 49 [2023-08-31 02:35:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330292208] [2023-08-31 02:35:03,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:35:03,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-31 02:35:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:35:03,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-31 02:35:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2078, Unknown=1, NotChecked=0, Total=2550 [2023-08-31 02:35:05,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:08,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:11,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:13,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:15,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:17,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:20,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:22,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:35:22,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 495 [2023-08-31 02:35:22,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 801 flow. Second operand has 51 states, 51 states have (on average 156.92156862745097) internal successors, (8003), 51 states have internal predecessors, (8003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:35:22,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:35:22,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 495 [2023-08-31 02:35:22,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:36:34,729 WARN L222 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 135 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:36:36,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:36:38,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:36:40,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:36:42,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:37:15,233 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-08-31 02:37:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-31 02:37:15,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-31 02:37:15,243 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 101 [2023-08-31 02:37:15,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:37:15,435 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 61 more [2023-08-31 02:37:15,442 INFO L158 Benchmark]: Toolchain (without parser) took 651261.14ms. Allocated memory was 94.4MB in the beginning and 507.5MB in the end (delta: 413.1MB). Free memory was 72.4MB in the beginning and 194.8MB in the end (delta: -122.3MB). Peak memory consumption was 291.6MB. Max. memory is 16.1GB. [2023-08-31 02:37:15,442 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 02:37:15,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.65ms. Allocated memory is still 94.4MB. Free memory was 72.1MB in the beginning and 59.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-31 02:37:15,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.66ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 56.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 02:37:15,442 INFO L158 Benchmark]: Boogie Preprocessor took 58.74ms. Allocated memory is still 94.4MB. Free memory was 56.8MB in the beginning and 54.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 02:37:15,443 INFO L158 Benchmark]: RCFGBuilder took 789.57ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 39.9MB in the end (delta: 14.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2023-08-31 02:37:15,443 INFO L158 Benchmark]: TraceAbstraction took 650211.53ms. Allocated memory was 94.4MB in the beginning and 507.5MB in the end (delta: 413.1MB). Free memory was 39.3MB in the beginning and 194.8MB in the end (delta: -155.5MB). Peak memory consumption was 256.1MB. Max. memory is 16.1GB. [2023-08-31 02:37:15,443 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.14ms. Allocated memory is still 54.5MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.65ms. Allocated memory is still 94.4MB. Free memory was 72.1MB in the beginning and 59.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.66ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 56.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.74ms. Allocated memory is still 94.4MB. Free memory was 56.8MB in the beginning and 54.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 789.57ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 39.9MB in the end (delta: 14.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 650211.53ms. Allocated memory was 94.4MB in the beginning and 507.5MB in the end (delta: 413.1MB). Free memory was 39.3MB in the beginning and 194.8MB in the end (delta: -155.5MB). Peak memory consumption was 256.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 226 PlacesBefore, 34 PlacesAfterwards, 235 TransitionsBefore, 30 TransitionsAfterwards, 1460 CoEnabledTransitionPairs, 8 FixpointIterations, 163 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 11 ConcurrentYvCompositions, 13 ChoiceCompositions, 247 TotalNumberOfCompositions, 3005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1957, independent: 1858, independent conditional: 0, independent unconditional: 1858, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 849, independent: 829, independent conditional: 0, independent unconditional: 829, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1957, independent: 1029, independent conditional: 0, independent unconditional: 1029, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 849, unknown conditional: 0, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 02:37:17,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:37:17,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:37:17,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:37:17,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:37:17,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:37:17,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:37:17,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:37:17,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:37:17,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:37:17,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:37:17,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:37:17,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:37:17,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:37:17,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:37:17,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:37:17,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:37:17,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:37:17,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:37:17,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:37:17,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:37:17,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:37:17,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:37:17,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:37:17,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:37:17,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:37:17,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:37:17,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:37:17,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:37:17,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:37:17,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:37:17,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:37:17,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:37:17,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:37:17,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:37:17,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:37:17,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:37:17,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:37:17,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:37:17,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:37:17,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:37:17,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-08-31 02:37:17,282 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:37:17,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:37:17,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:37:17,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:37:17,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:37:17,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:37:17,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:37:17,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:37:17,285 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:37:17,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:37:17,286 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:37:17,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:37:17,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:37:17,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:37:17,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:37:17,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:37:17,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:37:17,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:37:17,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:37:17,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:37:17,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:37:17,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:37:17,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:37:17,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:37:17,289 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 02:37:17,290 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:37:17,290 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 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 -> TOGETHER [2023-08-31 02:37:17,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:37:17,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:37:17,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:37:17,588 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:37:17,588 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:37:17,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-31 02:37:18,620 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:37:18,806 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:37:18,807 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-31 02:37:18,811 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e82d5f4f/22514883793c414391b6f6a9f779f1df/FLAGc7ff4154b [2023-08-31 02:37:18,821 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e82d5f4f/22514883793c414391b6f6a9f779f1df [2023-08-31 02:37:18,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:37:18,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:37:18,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:37:18,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:37:18,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:37:18,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:37:18" (1/1) ... [2023-08-31 02:37:18,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5e02f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:18, skipping insertion in model container [2023-08-31 02:37:18,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:37:18" (1/1) ... [2023-08-31 02:37:18,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:37:18,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:37:18,943 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-31 02:37:18,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:37:18,956 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-08-31 02:37:18,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:37:18,974 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-31 02:37:18,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:37:18,984 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:37:19,000 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-31 02:37:19,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:37:19,020 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:37:19,021 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:37:19,025 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:37:19,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19 WrapperNode [2023-08-31 02:37:19,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:37:19,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:37:19,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:37:19,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:37:19,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,081 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2023-08-31 02:37:19,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:37:19,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:37:19,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:37:19,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:37:19,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:37:19,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:37:19,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:37:19,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:37:19,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (1/1) ... [2023-08-31 02:37:19,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:37:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:37:19,165 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-08-31 02:37:19,184 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-08-31 02:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 02:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 02:37:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:37:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:37:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:37:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:37:19,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 02:37:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:37:19,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:37:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:37:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 02:37:19,201 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:37:19,372 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:37:19,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:37:19,858 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:37:20,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:37:20,051 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-31 02:37:20,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:37:20 BoogieIcfgContainer [2023-08-31 02:37:20,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:37:20,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:37:20,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:37:20,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:37:20,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:37:18" (1/3) ... [2023-08-31 02:37:20,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ffa346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:37:20, skipping insertion in model container [2023-08-31 02:37:20,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:19" (2/3) ... [2023-08-31 02:37:20,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ffa346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:37:20, skipping insertion in model container [2023-08-31 02:37:20,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:37:20" (3/3) ... [2023-08-31 02:37:20,060 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-08-31 02:37:20,065 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:37:20,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:37:20,070 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:37:20,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:37:20,139 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 02:37:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 237 transitions, 498 flow [2023-08-31 02:37:20,232 INFO L130 PetriNetUnfolder]: 19/234 cut-off events. [2023-08-31 02:37:20,232 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:37:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 234 events. 19/234 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2023-08-31 02:37:20,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 237 transitions, 498 flow [2023-08-31 02:37:20,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 224 transitions, 466 flow [2023-08-31 02:37:20,254 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:37:20,279 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 224 transitions, 466 flow [2023-08-31 02:37:20,282 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 224 transitions, 466 flow [2023-08-31 02:37:20,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 224 transitions, 466 flow [2023-08-31 02:37:20,338 INFO L130 PetriNetUnfolder]: 19/224 cut-off events. [2023-08-31 02:37:20,339 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:37:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 224 events. 19/224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2023-08-31 02:37:20,342 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 [2023-08-31 02:37:34,611 INFO L134 LiptonReduction]: Checked pairs total: 2927 [2023-08-31 02:37:34,612 INFO L136 LiptonReduction]: Total number of compositions: 231 [2023-08-31 02:37:34,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:37:34,649 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=true, 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;@36ed4b47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:37:34,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 02:37:34,669 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2023-08-31 02:37:34,669 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:37:34,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:34,670 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-08-31 02:37:34,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:34,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1788874544, now seen corresponding path program 1 times [2023-08-31 02:37:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555014204] [2023-08-31 02:37:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:34,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:34,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:34,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:34,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 02:37:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:34,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:37:34,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:37:34,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:37:34,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 02:37:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555014204] [2023-08-31 02:37:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555014204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:37:34,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:37:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 02:37:34,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806277409] [2023-08-31 02:37:34,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:37:34,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:37:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 02:37:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:37:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:37:34,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 468 [2023-08-31 02:37:34,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:34,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:37:34,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 468 [2023-08-31 02:37:34,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:37:35,189 INFO L130 PetriNetUnfolder]: 451/666 cut-off events. [2023-08-31 02:37:35,189 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-31 02:37:35,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 666 events. 451/666 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2323 event pairs, 73 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1134. Up to 548 conditions per place. [2023-08-31 02:37:35,193 INFO L137 encePairwiseOnDemand]: 463/468 looper letters, 42 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-08-31 02:37:35,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 221 flow [2023-08-31 02:37:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:37:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:37:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-08-31 02:37:35,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47649572649572647 [2023-08-31 02:37:35,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-08-31 02:37:35,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-08-31 02:37:35,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:37:35,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-08-31 02:37:35,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,219 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 3 states and 669 transitions. [2023-08-31 02:37:35,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 221 flow [2023-08-31 02:37:35,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 02:37:35,223 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 92 flow [2023-08-31 02:37:35,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2023-08-31 02:37:35,227 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2023-08-31 02:37:35,227 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 92 flow [2023-08-31 02:37:35,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:35,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:37:35,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 02:37:35,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:35,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:35,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2061697983, now seen corresponding path program 1 times [2023-08-31 02:37:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351383939] [2023-08-31 02:37:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:35,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:35,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:35,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:35,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 02:37:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:35,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:37:35,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:37:35,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:37:35,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 02:37:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351383939] [2023-08-31 02:37:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351383939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:37:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:37:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:37:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823652684] [2023-08-31 02:37:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:37:35,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:37:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 02:37:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:37:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:37:35,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 468 [2023-08-31 02:37:35,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:37:35,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 468 [2023-08-31 02:37:35,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:37:35,955 INFO L130 PetriNetUnfolder]: 732/1099 cut-off events. [2023-08-31 02:37:35,955 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2023-08-31 02:37:35,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2510 conditions, 1099 events. 732/1099 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4080 event pairs, 296 based on Foata normal form. 52/1058 useless extension candidates. Maximal degree in co-relation 1627. Up to 580 conditions per place. [2023-08-31 02:37:35,962 INFO L137 encePairwiseOnDemand]: 465/468 looper letters, 51 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-31 02:37:35,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 53 transitions, 246 flow [2023-08-31 02:37:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:37:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:37:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2023-08-31 02:37:35,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47507122507122507 [2023-08-31 02:37:35,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2023-08-31 02:37:35,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2023-08-31 02:37:35,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:37:35,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2023-08-31 02:37:35,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,972 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 92 flow. Second operand 3 states and 667 transitions. [2023-08-31 02:37:35,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 53 transitions, 246 flow [2023-08-31 02:37:35,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:37:35,974 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 96 flow [2023-08-31 02:37:35,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-08-31 02:37:35,975 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-08-31 02:37:35,976 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 96 flow [2023-08-31 02:37:35,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:35,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:35,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, 1, 1] [2023-08-31 02:37:36,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 02:37:36,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:36,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:36,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1283690444, now seen corresponding path program 1 times [2023-08-31 02:37:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706457109] [2023-08-31 02:37:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:36,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:36,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 02:37:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:36,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:37:36,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:37:36,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:37:36,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 02:37:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706457109] [2023-08-31 02:37:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706457109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:37:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:37:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:37:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941696744] [2023-08-31 02:37:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:37:36,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:37:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 02:37:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:37:36,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:37:36,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 468 [2023-08-31 02:37:36,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:36,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:37:36,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 468 [2023-08-31 02:37:36,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:37:36,594 INFO L130 PetriNetUnfolder]: 549/834 cut-off events. [2023-08-31 02:37:36,594 INFO L131 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2023-08-31 02:37:36,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 834 events. 549/834 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3121 event pairs, 139 based on Foata normal form. 30/793 useless extension candidates. Maximal degree in co-relation 680. Up to 670 conditions per place. [2023-08-31 02:37:36,598 INFO L137 encePairwiseOnDemand]: 465/468 looper letters, 39 selfloop transitions, 2 changer transitions 6/47 dead transitions. [2023-08-31 02:37:36,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 221 flow [2023-08-31 02:37:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:37:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:37:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2023-08-31 02:37:36,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47150997150997154 [2023-08-31 02:37:36,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 662 transitions. [2023-08-31 02:37:36,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 662 transitions. [2023-08-31 02:37:36,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:37:36,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 662 transitions. [2023-08-31 02:37:36,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:36,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:36,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:36,607 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 96 flow. Second operand 3 states and 662 transitions. [2023-08-31 02:37:36,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 221 flow [2023-08-31 02:37:36,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:37:36,609 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 102 flow [2023-08-31 02:37:36,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-31 02:37:36,610 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-08-31 02:37:36,610 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 102 flow [2023-08-31 02:37:36,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:36,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:36,611 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-08-31 02:37:36,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 02:37:36,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:36,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:36,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash -70559756, now seen corresponding path program 1 times [2023-08-31 02:37:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:36,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612220140] [2023-08-31 02:37:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:36,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:36,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 02:37:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:36,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:37:36,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:37:36,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:37:36,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 02:37:36,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612220140] [2023-08-31 02:37:36,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612220140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:37:36,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:37:36,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:37:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677330193] [2023-08-31 02:37:36,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:37:36,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:37:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 02:37:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:37:36,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:37:36,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 468 [2023-08-31 02:37:36,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:36,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:37:36,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 468 [2023-08-31 02:37:36,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:37:37,194 INFO L130 PetriNetUnfolder]: 353/544 cut-off events. [2023-08-31 02:37:37,195 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2023-08-31 02:37:37,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 544 events. 353/544 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1622 event pairs, 139 based on Foata normal form. 14/503 useless extension candidates. Maximal degree in co-relation 408. Up to 460 conditions per place. [2023-08-31 02:37:37,197 INFO L137 encePairwiseOnDemand]: 465/468 looper letters, 34 selfloop transitions, 2 changer transitions 7/43 dead transitions. [2023-08-31 02:37:37,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 211 flow [2023-08-31 02:37:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:37:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:37:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-08-31 02:37:37,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672364672364672 [2023-08-31 02:37:37,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-08-31 02:37:37,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-08-31 02:37:37,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:37:37,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-08-31 02:37:37,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:37,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:37,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 468.0) internal successors, (1872), 4 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:37,206 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 102 flow. Second operand 3 states and 656 transitions. [2023-08-31 02:37:37,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 211 flow [2023-08-31 02:37:37,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:37:37,208 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 112 flow [2023-08-31 02:37:37,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2023-08-31 02:37:37,209 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-31 02:37:37,209 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 112 flow [2023-08-31 02:37:37,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:37,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:37,210 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] [2023-08-31 02:37:37,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 02:37:37,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:37,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:37,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1726103745, now seen corresponding path program 1 times [2023-08-31 02:37:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:37,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111260692] [2023-08-31 02:37:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:37,424 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:37,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 02:37:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:37,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 02:37:37,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:37:37,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:37:37,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 02:37:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111260692] [2023-08-31 02:37:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111260692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:37:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:37:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:37:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974549835] [2023-08-31 02:37:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:37:37,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:37:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 02:37:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:37:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:37:37,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 468 [2023-08-31 02:37:37,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:37,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:37:37,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 468 [2023-08-31 02:37:37,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:37:38,036 INFO L130 PetriNetUnfolder]: 392/628 cut-off events. [2023-08-31 02:37:38,036 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2023-08-31 02:37:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 628 events. 392/628 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2046 event pairs, 291 based on Foata normal form. 14/636 useless extension candidates. Maximal degree in co-relation 834. Up to 545 conditions per place. [2023-08-31 02:37:38,039 INFO L137 encePairwiseOnDemand]: 464/468 looper letters, 33 selfloop transitions, 2 changer transitions 19/54 dead transitions. [2023-08-31 02:37:38,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 266 flow [2023-08-31 02:37:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:37:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:37:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 831 transitions. [2023-08-31 02:37:38,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4439102564102564 [2023-08-31 02:37:38,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 831 transitions. [2023-08-31 02:37:38,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 831 transitions. [2023-08-31 02:37:38,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:37:38,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 831 transitions. [2023-08-31 02:37:38,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 207.75) internal successors, (831), 4 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:38,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 468.0) internal successors, (2340), 5 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:38,059 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 468.0) internal successors, (2340), 5 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:38,059 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 112 flow. Second operand 4 states and 831 transitions. [2023-08-31 02:37:38,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 266 flow [2023-08-31 02:37:38,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:37:38,061 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 124 flow [2023-08-31 02:37:38,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-31 02:37:38,062 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-08-31 02:37:38,062 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 124 flow [2023-08-31 02:37:38,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:38,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:38,063 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] [2023-08-31 02:37:38,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 02:37:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:38,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:38,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1524298314, now seen corresponding path program 1 times [2023-08-31 02:37:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:38,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830066162] [2023-08-31 02:37:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:38,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:38,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:38,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 02:37:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:38,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 02:37:38,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:37:38,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:37:38,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 02:37:38,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830066162] [2023-08-31 02:37:38,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830066162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:37:38,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:37:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 02:37:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208895921] [2023-08-31 02:37:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:37:38,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:37:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 02:37:38,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:37:38,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:37:38,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 468 [2023-08-31 02:37:38,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:38,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:37:38,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 468 [2023-08-31 02:37:38,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:37:39,229 INFO L130 PetriNetUnfolder]: 881/1329 cut-off events. [2023-08-31 02:37:39,229 INFO L131 PetriNetUnfolder]: For 749/749 co-relation queries the response was YES. [2023-08-31 02:37:39,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 1329 events. 881/1329 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4953 event pairs, 289 based on Foata normal form. 42/1368 useless extension candidates. Maximal degree in co-relation 3450. Up to 492 conditions per place. [2023-08-31 02:37:39,248 INFO L137 encePairwiseOnDemand]: 463/468 looper letters, 63 selfloop transitions, 9 changer transitions 8/80 dead transitions. [2023-08-31 02:37:39,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 80 transitions, 421 flow [2023-08-31 02:37:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:37:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:37:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1091 transitions. [2023-08-31 02:37:39,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46623931623931625 [2023-08-31 02:37:39,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1091 transitions. [2023-08-31 02:37:39,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1091 transitions. [2023-08-31 02:37:39,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:37:39,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1091 transitions. [2023-08-31 02:37:39,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 218.2) internal successors, (1091), 5 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:39,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 468.0) internal successors, (2808), 6 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:39,256 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 468.0) internal successors, (2808), 6 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:39,257 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 124 flow. Second operand 5 states and 1091 transitions. [2023-08-31 02:37:39,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 80 transitions, 421 flow [2023-08-31 02:37:39,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 80 transitions, 415 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 02:37:39,259 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 179 flow [2023-08-31 02:37:39,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-31 02:37:39,259 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-08-31 02:37:39,260 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 179 flow [2023-08-31 02:37:39,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:37:39,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:37:39,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:37:39,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 02:37:39,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:39,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:37:39,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:37:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash -924926018, now seen corresponding path program 1 times [2023-08-31 02:37:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 02:37:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131527007] [2023-08-31 02:37:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:37:39,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 02:37:39,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 02:37:39,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 02:37:39,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 02:37:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:37:39,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-31 02:37:39,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:37:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:37:43,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:37:56,160 WARN L222 SmtUtils]: Spent 12.49s on a formula simplification. DAG size of input: 70 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:37:58,312 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse4 (bvmul (_ bv4 32) c_~client_back~0)) (.cse3 (let ((.cse8 (bvmul (_ bv4 32) c_~manager_back~0))) (concat (concat (concat (select .cse5 (bvadd c_~manager~0.offset .cse8 (_ bv3 32))) (select .cse5 (bvadd c_~manager~0.offset (_ bv2 32) .cse8))) (select .cse5 (bvadd c_~manager~0.offset .cse8 (_ bv1 32)))) (select .cse5 (bvadd c_~manager~0.offset .cse8)))))) (let ((.cse0 (forall ((~client~0.offset (_ BitVec 32)) (~client~0.base (_ BitVec 32))) (not (= (let ((.cse7 (select |c_#memory_int| ~client~0.base))) (concat (concat (concat (select .cse7 (bvadd (_ bv3 32) ~client~0.offset .cse4)) (select .cse7 (bvadd (_ bv2 32) ~client~0.offset .cse4))) (select .cse7 (bvadd ~client~0.offset (_ bv1 32) .cse4))) (select .cse7 (bvadd ~client~0.offset .cse4)))) .cse3))))) (and (or (not (= c_~safe~0 (_ bv0 8))) .cse0) (forall ((~client~0.offset (_ BitVec 32)) (~client~0.base (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| ~client~0.base))) (or (= (let ((.cse2 (bvmul (_ bv4 32) c_~client_front~0))) (concat (concat (concat (select .cse1 (bvadd .cse2 (_ bv3 32) ~client~0.offset)) (select .cse1 (bvadd .cse2 (_ bv2 32) ~client~0.offset))) (select .cse1 (bvadd .cse2 ~client~0.offset (_ bv1 32)))) (select .cse1 (bvadd .cse2 ~client~0.offset)))) .cse3) (not (= (concat (concat (concat (select .cse1 (bvadd (_ bv3 32) ~client~0.offset .cse4)) (select .cse1 (bvadd (_ bv2 32) ~client~0.offset .cse4))) (select .cse1 (bvadd ~client~0.offset (_ bv1 32) .cse4))) (select .cse1 (bvadd ~client~0.offset .cse4))) .cse3))))) (or .cse0 (= .cse3 (let ((.cse6 (bvmul (_ bv4 32) c_~manager_front~0))) (concat (concat (concat (select .cse5 (bvadd c_~manager~0.offset (_ bv3 32) .cse6)) (select .cse5 (bvadd c_~manager~0.offset (_ bv2 32) .cse6))) (select .cse5 (bvadd c_~manager~0.offset (_ bv1 32) .cse6))) (select .cse5 (bvadd c_~manager~0.offset .cse6)))))))))) is different from false [2023-08-31 02:38:00,810 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse12 (bvmul (_ bv4 32) c_~client_back~0)) (.cse5 (let ((.cse14 (bvmul (_ bv4 32) c_~manager_back~0))) (concat (concat (concat (select .cse6 (bvadd c_~manager~0.offset .cse14 (_ bv3 32))) (select .cse6 (bvadd c_~manager~0.offset (_ bv2 32) .cse14))) (select .cse6 (bvadd c_~manager~0.offset .cse14 (_ bv1 32)))) (select .cse6 (bvadd c_~manager~0.offset .cse14)))))) (let ((.cse4 (forall ((~client~0.offset (_ BitVec 32)) (~client~0.base (_ BitVec 32))) (not (= (let ((.cse13 (select |c_#memory_int| ~client~0.base))) (concat (concat (concat (select .cse13 (bvadd (_ bv3 32) ~client~0.offset .cse12)) (select .cse13 (bvadd (_ bv2 32) ~client~0.offset .cse12))) (select .cse13 (bvadd ~client~0.offset (_ bv1 32) .cse12))) (select .cse13 (bvadd ~client~0.offset .cse12)))) .cse5)))) (.cse3 (forall ((~client~0.offset (_ BitVec 32)) (~client~0.base (_ BitVec 32))) (let ((.cse10 (select |c_#memory_int| ~client~0.base))) (or (= (let ((.cse11 (bvmul (_ bv4 32) c_~client_front~0))) (concat (concat (concat (select .cse10 (bvadd .cse11 (_ bv3 32) ~client~0.offset)) (select .cse10 (bvadd .cse11 (_ bv2 32) ~client~0.offset))) (select .cse10 (bvadd .cse11 ~client~0.offset (_ bv1 32)))) (select .cse10 (bvadd .cse11 ~client~0.offset)))) .cse5) (not (= (concat (concat (concat (select .cse10 (bvadd (_ bv3 32) ~client~0.offset .cse12)) (select .cse10 (bvadd (_ bv2 32) ~client~0.offset .cse12))) (select .cse10 (bvadd ~client~0.offset (_ bv1 32) .cse12))) (select .cse10 (bvadd ~client~0.offset .cse12))) .cse5))))))) (let ((.cse1 (and .cse4 .cse3)) (.cse0 (= c_~safe~0 (_ bv0 8)))) (and (or (not .cse0) .cse1) (or (let ((.cse2 (= c_~update~0 (let ((.cse8 (select |c_#memory_int| c_~node~0.base)) (.cse9 (bvmul (_ bv4 32) c_~node_front~0))) (concat (concat (concat (select .cse8 (bvadd (_ bv3 32) c_~node~0.offset .cse9)) (select .cse8 (bvadd (_ bv2 32) c_~node~0.offset .cse9))) (select .cse8 (bvadd (_ bv1 32) c_~node~0.offset .cse9))) (select .cse8 (bvadd c_~node~0.offset .cse9))))))) (and (or (not .cse2) (and .cse3 (or .cse4 (= .cse5 (let ((.cse7 (bvmul (_ bv4 32) c_~manager_front~0))) (concat (concat (concat (select .cse6 (bvadd c_~manager~0.offset (_ bv3 32) .cse7)) (select .cse6 (bvadd c_~manager~0.offset (_ bv2 32) .cse7))) (select .cse6 (bvadd c_~manager~0.offset (_ bv1 32) .cse7))) (select .cse6 (bvadd c_~manager~0.offset .cse7)))))))) (or .cse1 .cse2))) .cse0)))))) is different from false [2023-08-31 02:39:05,588 WARN L222 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 122 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:40:12,420 WARN L222 SmtUtils]: Spent 55.27s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:40:32,971 WARN L222 SmtUtils]: Spent 20.45s on a formula simplification. DAG size of input: 561 DAG size of output: 445 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-08-31 02:40:32,976 INFO L321 Elim1Store]: treesize reduction 492, result has 81.5 percent of original size [2023-08-31 02:40:32,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 264 treesize of output 2221 Killed by 15