./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 BEFORE --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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:16:53,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:16:53,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:16:53,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:16:53,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:16:53,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:16:53,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:16:53,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:16:53,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:16:53,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:16:53,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:16:53,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:16:53,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:16:53,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:16:53,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:16:53,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:16:53,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:16:53,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:16:53,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:16:53,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:16:53,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:16:53,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:16:53,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:16:53,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:16:53,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:16:53,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:16:53,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:16:53,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:16:53,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:16:53,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:16:53,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:16:53,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:16:53,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:16:53,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:16:53,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:16:53,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:16:53,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:16:53,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:16:53,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:16:53,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:16:53,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:16:53,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 13:16:53,627 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:16:53,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:16:53,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:16:53,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:16:53,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:16:53,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:16:53,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:16:53,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:16:53,630 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:16:53,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:16:53,631 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:16:53,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 13:16:53,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:16:53,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:16:53,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:16:53,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:16:53,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:16:53,632 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:16:53,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:16:53,632 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:16:53,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:16:53,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:16:53,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:16:53,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:16:53,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:16:53,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:16:53,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:16:53,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:16:53,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 13:16:53,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 13:16:53,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:16:53,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:16:53,634 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:16:53,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:16:53,634 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:16:53,634 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 -> BEFORE [2023-09-01 13:16:53,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:16:53,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:16:53,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:16:53,890 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:16:53,891 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:16:53,892 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-09-01 13:16:54,915 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:16:55,120 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:16:55,121 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-09-01 13:16:55,130 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183b06352/075b4e80936a44eb9d5a1a8ea78f5d8d/FLAG6876fd87c [2023-09-01 13:16:55,148 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183b06352/075b4e80936a44eb9d5a1a8ea78f5d8d [2023-09-01 13:16:55,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:16:55,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:16:55,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:16:55,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:16:55,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:16:55,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0e790d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55, skipping insertion in model container [2023-09-01 13:16:55,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:16:55,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:16:55,308 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-09-01 13:16:55,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:16:55,330 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:16:55,362 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-09-01 13:16:55,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:16:55,379 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:16:55,381 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:16:55,386 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:16:55,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55 WrapperNode [2023-09-01 13:16:55,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:16:55,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:16:55,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:16:55,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:16:55,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,448 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 347 [2023-09-01 13:16:55,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:16:55,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:16:55,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:16:55,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:16:55,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,489 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:16:55,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:16:55,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:16:55,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:16:55,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (1/1) ... [2023-09-01 13:16:55,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:16:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:16:55,534 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-09-01 13:16:55,550 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-09-01 13:16:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:16:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:16:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 13:16:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 13:16:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:16:55,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:16:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:16:55,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:16:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 13:16:55,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 13:16:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 13:16:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:16:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:16:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:16:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:16:55,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:16:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:16:55,575 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:16:55,721 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:16:55,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:16:56,116 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:16:56,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:16:56,280 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-09-01 13:16:56,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:16:56 BoogieIcfgContainer [2023-09-01 13:16:56,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:16:56,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:16:56,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:16:56,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:16:56,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:16:55" (1/3) ... [2023-09-01 13:16:56,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ac3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:16:56, skipping insertion in model container [2023-09-01 13:16:56,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:16:55" (2/3) ... [2023-09-01 13:16:56,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ac3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:16:56, skipping insertion in model container [2023-09-01 13:16:56,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:16:56" (3/3) ... [2023-09-01 13:16:56,301 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-09-01 13:16:56,306 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:16:56,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:16:56,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:16:56,318 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:16:56,382 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 13:16:56,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 248 transitions, 520 flow [2023-09-01 13:16:56,515 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2023-09-01 13:16:56,516 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:16:56,521 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-09-01 13:16:56,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 248 transitions, 520 flow [2023-09-01 13:16:56,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 235 transitions, 488 flow [2023-09-01 13:16:56,529 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:16:56,539 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 235 transitions, 488 flow [2023-09-01 13:16:56,545 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 235 transitions, 488 flow [2023-09-01 13:16:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 235 transitions, 488 flow [2023-09-01 13:16:56,585 INFO L130 PetriNetUnfolder]: 19/235 cut-off events. [2023-09-01 13:16:56,585 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:16:56,587 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-09-01 13:16:56,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 [2023-09-01 13:17:03,439 INFO L134 LiptonReduction]: Checked pairs total: 3005 [2023-09-01 13:17:03,440 INFO L136 LiptonReduction]: Total number of compositions: 247 [2023-09-01 13:17:03,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 13:17:03,456 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;@4b41d120, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 13:17:03,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 13:17:03,477 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2023-09-01 13:17:03,477 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:17:03,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:03,478 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-09-01 13:17:03,478 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-09-01 13:17:03,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 169519787, now seen corresponding path program 1 times [2023-09-01 13:17:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:03,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099149950] [2023-09-01 13:17:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:17:04,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:04,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099149950] [2023-09-01 13:17:04,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099149950] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:04,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:04,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:17:04,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597673450] [2023-09-01 13:17:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:04,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:17:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:17:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 13:17:04,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 495 [2023-09-01 13:17:04,312 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-09-01 13:17:04,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:04,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 495 [2023-09-01 13:17:04,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:04,480 INFO L130 PetriNetUnfolder]: 564/838 cut-off events. [2023-09-01 13:17:04,480 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-09-01 13:17:04,482 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-09-01 13:17:04,485 INFO L137 encePairwiseOnDemand]: 485/495 looper letters, 57 selfloop transitions, 12 changer transitions 2/71 dead transitions. [2023-09-01 13:17:04,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 335 flow [2023-09-01 13:17:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:17:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:17:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 885 transitions. [2023-09-01 13:17:04,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2023-09-01 13:17:04,499 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 885 transitions. [2023-09-01 13:17:04,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 885 transitions. [2023-09-01 13:17:04,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:04,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 885 transitions. [2023-09-01 13:17:04,507 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-09-01 13:17:04,513 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-09-01 13:17:04,514 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-09-01 13:17:04,515 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 4 states and 885 transitions. [2023-09-01 13:17:04,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 335 flow [2023-09-01 13:17:04,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 301 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-09-01 13:17:04,521 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 149 flow [2023-09-01 13:17:04,522 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-09-01 13:17:04,525 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-09-01 13:17:04,525 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 149 flow [2023-09-01 13:17:04,526 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-09-01 13:17:04,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:04,526 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-09-01 13:17:04,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 13:17:04,527 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-09-01 13:17:04,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 790486479, now seen corresponding path program 1 times [2023-09-01 13:17:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:04,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961503343] [2023-09-01 13:17:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:17:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961503343] [2023-09-01 13:17:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961503343] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:04,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:04,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:17:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481828626] [2023-09-01 13:17:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:04,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:17:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:04,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:17:04,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:17:04,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-09-01 13:17:04,692 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-09-01 13:17:04,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:04,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-09-01 13:17:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:04,837 INFO L130 PetriNetUnfolder]: 680/1058 cut-off events. [2023-09-01 13:17:04,837 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-09-01 13:17:04,839 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-09-01 13:17:04,842 INFO L137 encePairwiseOnDemand]: 489/495 looper letters, 38 selfloop transitions, 2 changer transitions 24/64 dead transitions. [2023-09-01 13:17:04,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 353 flow [2023-09-01 13:17:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:17:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:17:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2023-09-01 13:17:04,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44343434343434346 [2023-09-01 13:17:04,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 878 transitions. [2023-09-01 13:17:04,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 878 transitions. [2023-09-01 13:17:04,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:04,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 878 transitions. [2023-09-01 13:17:04,846 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-09-01 13:17:04,848 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-09-01 13:17:04,849 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-09-01 13:17:04,849 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 149 flow. Second operand 4 states and 878 transitions. [2023-09-01 13:17:04,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 353 flow [2023-09-01 13:17:04,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 13:17:04,852 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 159 flow [2023-09-01 13:17:04,852 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-09-01 13:17:04,853 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-09-01 13:17:04,853 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 159 flow [2023-09-01 13:17:04,854 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-09-01 13:17:04,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:04,854 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-09-01 13:17:04,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 13:17:04,854 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-09-01 13:17:04,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash 611376253, now seen corresponding path program 1 times [2023-09-01 13:17:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819000700] [2023-09-01 13:17:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:17:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819000700] [2023-09-01 13:17:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819000700] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:05,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:17:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274121324] [2023-09-01 13:17:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:17:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:17:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:17:05,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 495 [2023-09-01 13:17:05,031 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-09-01 13:17:05,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:05,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 495 [2023-09-01 13:17:05,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:05,153 INFO L130 PetriNetUnfolder]: 623/959 cut-off events. [2023-09-01 13:17:05,153 INFO L131 PetriNetUnfolder]: For 367/367 co-relation queries the response was YES. [2023-09-01 13:17:05,154 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-09-01 13:17:05,157 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 54 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-09-01 13:17:05,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 314 flow [2023-09-01 13:17:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:17:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:17:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-09-01 13:17:05,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653198653198653 [2023-09-01 13:17:05,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-09-01 13:17:05,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-09-01 13:17:05,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:05,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-09-01 13:17:05,161 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-09-01 13:17:05,163 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-09-01 13:17:05,164 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-09-01 13:17:05,164 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 159 flow. Second operand 3 states and 691 transitions. [2023-09-01 13:17:05,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 314 flow [2023-09-01 13:17:05,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 13:17:05,166 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 157 flow [2023-09-01 13:17:05,166 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-09-01 13:17:05,167 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-09-01 13:17:05,167 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 157 flow [2023-09-01 13:17:05,167 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-09-01 13:17:05,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:05,168 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-09-01 13:17:05,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 13:17:05,168 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-09-01 13:17:05,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 654922567, now seen corresponding path program 1 times [2023-09-01 13:17:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676830686] [2023-09-01 13:17:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:17:05,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:05,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676830686] [2023-09-01 13:17:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676830686] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:17:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875295100] [2023-09-01 13:17:05,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:05,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:17:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:17:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:17:05,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-09-01 13:17:05,258 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-09-01 13:17:05,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:05,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-09-01 13:17:05,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:05,397 INFO L130 PetriNetUnfolder]: 625/969 cut-off events. [2023-09-01 13:17:05,397 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-09-01 13:17:05,398 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-09-01 13:17:05,401 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 47 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2023-09-01 13:17:05,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2023-09-01 13:17:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:17:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:17:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-09-01 13:17:05,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707070707070707 [2023-09-01 13:17:05,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-09-01 13:17:05,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-09-01 13:17:05,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:05,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-09-01 13:17:05,405 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-09-01 13:17:05,407 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-09-01 13:17:05,408 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-09-01 13:17:05,408 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 157 flow. Second operand 3 states and 699 transitions. [2023-09-01 13:17:05,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2023-09-01 13:17:05,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 13:17:05,410 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 157 flow [2023-09-01 13:17:05,410 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-09-01 13:17:05,411 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-09-01 13:17:05,411 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 157 flow [2023-09-01 13:17:05,412 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-09-01 13:17:05,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:05,412 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-09-01 13:17:05,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 13:17:05,412 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-09-01 13:17:05,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1525535317, now seen corresponding path program 1 times [2023-09-01 13:17:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083988370] [2023-09-01 13:17:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:17:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:05,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083988370] [2023-09-01 13:17:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083988370] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:17:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378844317] [2023-09-01 13:17:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:17:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:17:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:17:05,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-09-01 13:17:05,565 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-09-01 13:17:05,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:05,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-09-01 13:17:05,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:05,729 INFO L130 PetriNetUnfolder]: 883/1411 cut-off events. [2023-09-01 13:17:05,729 INFO L131 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES. [2023-09-01 13:17:05,731 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-09-01 13:17:05,733 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 34 selfloop transitions, 3 changer transitions 25/62 dead transitions. [2023-09-01 13:17:05,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 361 flow [2023-09-01 13:17:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:17:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:17:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 879 transitions. [2023-09-01 13:17:05,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44393939393939397 [2023-09-01 13:17:05,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 879 transitions. [2023-09-01 13:17:05,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 879 transitions. [2023-09-01 13:17:05,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:05,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 879 transitions. [2023-09-01 13:17:05,750 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-09-01 13:17:05,752 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-09-01 13:17:05,753 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-09-01 13:17:05,753 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 157 flow. Second operand 4 states and 879 transitions. [2023-09-01 13:17:05,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 361 flow [2023-09-01 13:17:05,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 13:17:05,756 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 161 flow [2023-09-01 13:17:05,756 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-09-01 13:17:05,758 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-09-01 13:17:05,758 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 161 flow [2023-09-01 13:17:05,759 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-09-01 13:17:05,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:05,759 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-09-01 13:17:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 13:17:05,759 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-09-01 13:17:05,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -424741139, now seen corresponding path program 1 times [2023-09-01 13:17:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791829330] [2023-09-01 13:17:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:17:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:05,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791829330] [2023-09-01 13:17:05,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791829330] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:05,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:05,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:17:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323225252] [2023-09-01 13:17:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:05,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:17:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:17:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:17:05,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-09-01 13:17:05,941 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-09-01 13:17:05,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:05,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-09-01 13:17:05,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:06,092 INFO L130 PetriNetUnfolder]: 634/996 cut-off events. [2023-09-01 13:17:06,093 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-09-01 13:17:06,094 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-09-01 13:17:06,097 INFO L137 encePairwiseOnDemand]: 487/495 looper letters, 30 selfloop transitions, 6 changer transitions 17/53 dead transitions. [2023-09-01 13:17:06,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 307 flow [2023-09-01 13:17:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:17:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:17:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1081 transitions. [2023-09-01 13:17:06,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43676767676767675 [2023-09-01 13:17:06,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1081 transitions. [2023-09-01 13:17:06,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1081 transitions. [2023-09-01 13:17:06,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:06,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1081 transitions. [2023-09-01 13:17:06,101 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-09-01 13:17:06,104 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-09-01 13:17:06,104 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-09-01 13:17:06,104 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 161 flow. Second operand 5 states and 1081 transitions. [2023-09-01 13:17:06,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 307 flow [2023-09-01 13:17:06,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 297 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 13:17:06,108 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 166 flow [2023-09-01 13:17:06,108 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-09-01 13:17:06,110 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-09-01 13:17:06,110 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 166 flow [2023-09-01 13:17:06,111 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-09-01 13:17:06,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:06,111 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-09-01 13:17:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 13:17:06,112 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-09-01 13:17:06,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1608617032, now seen corresponding path program 1 times [2023-09-01 13:17:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200289104] [2023-09-01 13:17:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:17:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200289104] [2023-09-01 13:17:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200289104] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:17:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925965401] [2023-09-01 13:17:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:17:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:17:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:17:06,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-09-01 13:17:06,247 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-09-01 13:17:06,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:06,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-09-01 13:17:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:06,371 INFO L130 PetriNetUnfolder]: 353/547 cut-off events. [2023-09-01 13:17:06,372 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-09-01 13:17:06,373 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-09-01 13:17:06,374 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 37 selfloop transitions, 2 changer transitions 7/46 dead transitions. [2023-09-01 13:17:06,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 283 flow [2023-09-01 13:17:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:17:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:17:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-09-01 13:17:06,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463973063973064 [2023-09-01 13:17:06,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-09-01 13:17:06,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-09-01 13:17:06,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:06,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-09-01 13:17:06,378 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-09-01 13:17:06,380 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-09-01 13:17:06,381 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-09-01 13:17:06,381 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 166 flow. Second operand 3 states and 689 transitions. [2023-09-01 13:17:06,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 283 flow [2023-09-01 13:17:06,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 261 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-09-01 13:17:06,382 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 158 flow [2023-09-01 13:17:06,383 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-09-01 13:17:06,383 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-09-01 13:17:06,383 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 158 flow [2023-09-01 13:17:06,384 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-09-01 13:17:06,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:06,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, 1, 1] [2023-09-01 13:17:06,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 13:17:06,384 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-09-01 13:17:06,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1743219548, now seen corresponding path program 1 times [2023-09-01 13:17:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13695368] [2023-09-01 13:17:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:17:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13695368] [2023-09-01 13:17:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13695368] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:17:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981630610] [2023-09-01 13:17:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:06,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:17:06,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:17:06,650 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-09-01 13:17:06,675 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-09-01 13:17:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:06,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 13:17:06,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:17:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:17:06,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:17:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:17:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981630610] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:17:07,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:17:07,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-09-01 13:17:07,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535789455] [2023-09-01 13:17:07,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:17:07,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 13:17:07,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:07,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 13:17:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-09-01 13:17:07,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 495 [2023-09-01 13:17:07,400 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-09-01 13:17:07,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:07,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 495 [2023-09-01 13:17:07,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:07,899 INFO L130 PetriNetUnfolder]: 1251/2042 cut-off events. [2023-09-01 13:17:07,899 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2023-09-01 13:17:07,902 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-09-01 13:17:07,906 INFO L137 encePairwiseOnDemand]: 484/495 looper letters, 78 selfloop transitions, 16 changer transitions 118/212 dead transitions. [2023-09-01 13:17:07,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 212 transitions, 1170 flow [2023-09-01 13:17:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-09-01 13:17:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-09-01 13:17:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4052 transitions. [2023-09-01 13:17:07,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092929292929293 [2023-09-01 13:17:07,914 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4052 transitions. [2023-09-01 13:17:07,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4052 transitions. [2023-09-01 13:17:07,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:07,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4052 transitions. [2023-09-01 13:17:07,920 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-09-01 13:17:07,928 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-09-01 13:17:07,930 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-09-01 13:17:07,930 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 158 flow. Second operand 20 states and 4052 transitions. [2023-09-01 13:17:07,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 212 transitions, 1170 flow [2023-09-01 13:17:07,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 212 transitions, 1157 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-09-01 13:17:07,933 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 319 flow [2023-09-01 13:17:07,934 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-09-01 13:17:07,934 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-09-01 13:17:07,934 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 319 flow [2023-09-01 13:17:07,935 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-09-01 13:17:07,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:07,935 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-09-01 13:17:07,949 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-09-01 13:17:08,141 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-09-01 13:17:08,142 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-09-01 13:17:08,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:08,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2011379154, now seen corresponding path program 2 times [2023-09-01 13:17:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:08,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357894366] [2023-09-01 13:17:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:08,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-01 13:17:08,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357894366] [2023-09-01 13:17:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357894366] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:17:08,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:17:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:17:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017386312] [2023-09-01 13:17:08,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:17:08,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:17:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:17:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 13:17:08,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 495 [2023-09-01 13:17:08,309 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-09-01 13:17:08,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:08,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 495 [2023-09-01 13:17:08,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:08,653 INFO L130 PetriNetUnfolder]: 2001/3024 cut-off events. [2023-09-01 13:17:08,653 INFO L131 PetriNetUnfolder]: For 9982/9982 co-relation queries the response was YES. [2023-09-01 13:17:08,658 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-09-01 13:17:08,669 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 73 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2023-09-01 13:17:08,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 727 flow [2023-09-01 13:17:08,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:17:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:17:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 922 transitions. [2023-09-01 13:17:08,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46565656565656566 [2023-09-01 13:17:08,671 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 922 transitions. [2023-09-01 13:17:08,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 922 transitions. [2023-09-01 13:17:08,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:08,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 922 transitions. [2023-09-01 13:17:08,673 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-09-01 13:17:08,675 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-09-01 13:17:08,675 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-09-01 13:17:08,676 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 319 flow. Second operand 4 states and 922 transitions. [2023-09-01 13:17:08,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 727 flow [2023-09-01 13:17:08,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 638 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-09-01 13:17:08,684 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 429 flow [2023-09-01 13:17:08,685 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-09-01 13:17:08,685 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-09-01 13:17:08,685 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 429 flow [2023-09-01 13:17:08,686 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-09-01 13:17:08,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:08,686 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-09-01 13:17:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 13:17:08,686 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-09-01 13:17:08,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -23841826, now seen corresponding path program 1 times [2023-09-01 13:17:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287013855] [2023-09-01 13:17:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:17:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287013855] [2023-09-01 13:17:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287013855] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:17:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973239044] [2023-09-01 13:17:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:08,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:17:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:17:08,858 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-09-01 13:17:08,859 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-09-01 13:17:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:08,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 13:17:08,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:17:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:17:09,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:17:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:17:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973239044] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:17:09,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:17:09,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-09-01 13:17:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597939463] [2023-09-01 13:17:09,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:17:09,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 13:17:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:17:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 13:17:09,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-09-01 13:17:09,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 495 [2023-09-01 13:17:09,299 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-09-01 13:17:09,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:17:09,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 495 [2023-09-01 13:17:09,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:17:09,485 INFO L130 PetriNetUnfolder]: 949/1472 cut-off events. [2023-09-01 13:17:09,485 INFO L131 PetriNetUnfolder]: For 4771/4771 co-relation queries the response was YES. [2023-09-01 13:17:09,488 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-09-01 13:17:09,493 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 42 selfloop transitions, 3 changer transitions 33/78 dead transitions. [2023-09-01 13:17:09,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 598 flow [2023-09-01 13:17:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 13:17:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 13:17:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2023-09-01 13:17:09,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2023-09-01 13:17:09,496 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1251 transitions. [2023-09-01 13:17:09,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1251 transitions. [2023-09-01 13:17:09,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:17:09,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1251 transitions. [2023-09-01 13:17:09,498 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-09-01 13:17:09,501 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-09-01 13:17:09,501 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-09-01 13:17:09,501 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 429 flow. Second operand 6 states and 1251 transitions. [2023-09-01 13:17:09,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 598 flow [2023-09-01 13:17:09,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 560 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-09-01 13:17:09,510 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 275 flow [2023-09-01 13:17:09,510 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-09-01 13:17:09,511 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-09-01 13:17:09,511 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 275 flow [2023-09-01 13:17:09,512 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-09-01 13:17:09,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:17:09,512 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-09-01 13:17:09,538 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-09-01 13:17:09,718 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-09-01 13:17:09,718 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-09-01 13:17:09,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:17:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1711614402, now seen corresponding path program 2 times [2023-09-01 13:17:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:17:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578651512] [2023-09-01 13:17:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:17:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:17:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:17:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:17:12,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:17:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578651512] [2023-09-01 13:17:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578651512] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:17:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349449343] [2023-09-01 13:17:12,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:17:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:17:12,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:17:12,554 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-09-01 13:17:12,555 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-09-01 13:17:12,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:17:12,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:17:12,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 74 conjunts are in the unsatisfiable core [2023-09-01 13:17:12,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:17:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 13:17:13,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:17:26,011 WARN L222 SmtUtils]: Spent 10.07s 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-09-01 13:17:28,137 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-09-01 13:18:18,504 WARN L222 SmtUtils]: Spent 50.21s 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-09-01 13:19:11,573 WARN L222 SmtUtils]: Spent 50.70s 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-09-01 13:19:11,676 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-09-01 13:19:11,677 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-09-01 13:19:11,750 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-09-01 13:19:11,750 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-09-01 13:19:11,836 INFO L321 Elim1Store]: treesize reduction 48, result has 68.8 percent of original size [2023-09-01 13:19:11,837 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-09-01 13:19:12,024 INFO L321 Elim1Store]: treesize reduction 266, result has 43.9 percent of original size [2023-09-01 13:19:12,024 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-09-01 13:19:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-09-01 13:19:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349449343] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:19:12,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:19:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 43 [2023-09-01 13:19:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256989203] [2023-09-01 13:19:12,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:19:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-09-01 13:19:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:19:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-09-01 13:19:12,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1627, Unknown=3, NotChecked=84, Total=1980 [2023-09-01 13:19:14,427 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-09-01 13:19:16,482 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-09-01 13:19:18,600 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-09-01 13:19:20,640 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-09-01 13:19:22,659 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-09-01 13:19:24,664 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-09-01 13:19:26,696 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-09-01 13:19:28,726 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-09-01 13:19:30,854 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-09-01 13:19:33,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:19:35,044 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-09-01 13:19:37,154 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-09-01 13:19:39,184 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-09-01 13:19:41,325 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-09-01 13:19:43,359 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-09-01 13:19:45,373 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-09-01 13:19:47,440 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-09-01 13:19:49,467 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-09-01 13:19:51,472 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-09-01 13:19:53,526 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-09-01 13:19:55,541 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-09-01 13:19:57,552 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-09-01 13:19:57,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 495 [2023-09-01 13:19:57,568 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-09-01 13:19:57,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:19:57,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 495 [2023-09-01 13:19:57,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:20:19,296 WARN L222 SmtUtils]: Spent 16.13s 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-09-01 13:20:45,797 WARN L222 SmtUtils]: Spent 18.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-09-01 13:21:44,075 WARN L222 SmtUtils]: Spent 56.20s 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-09-01 13:21:46,101 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-09-01 13:21:48,107 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-09-01 13:21:50,115 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-09-01 13:21:52,121 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-09-01 13:21:54,125 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-09-01 13:22:38,783 WARN L222 SmtUtils]: Spent 40.60s 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-09-01 13:22:51,154 WARN L222 SmtUtils]: Spent 12.15s 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-09-01 13:22:53,179 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~manager~0.base)) (.cse1 (* c_~manager_back~0 4))) (let ((.cse22 (* c_~client_back~0 4)) (.cse12 (select .cse0 (+ c_~manager~0.offset .cse1)))) (let ((.cse20 (= (mod c_~safe~0 256) 0)) (.cse13 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse23 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse12 (select .cse23 (+ .cse22 ~client~0.offset)))) (= (select .cse23 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse12))))) (.cse5 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse12 (select (select |c_#memory_int| ~client~0.base) (+ .cse22 ~client~0.offset)))))) (.cse21 (* c_~node_front~0 4)) (.cse11 (* 4 c_~manager_front~0))) (let ((.cse14 (select .cse0 (+ .cse11 c_~manager~0.offset))) (.cse8 (+ .cse21 c_~node~0.offset)) (.cse18 (and .cse13 .cse5)) (.cse19 (select |c_#memory_int| c_~node~0.base)) (.cse3 (< c_~node_back~0 0)) (.cse2 (= c_~manager_back~0 c_~manager_front~0)) (.cse16 (= c_~client_back~0 c_~client_front~0)) (.cse6 (not .cse20)) (.cse15 (<= c_~node_size~0 c_~node_back~0))) (and (= (select .cse0 (+ (- 4) c_~manager~0.offset .cse1)) c_~update~0) .cse2 (<= c_~node_front~0 0) (or .cse3 (let ((.cse9 (+ (* c_~node_back~0 4) c_~node~0.offset))) (let ((.cse4 (forall ((~node~0.base Int)) (not (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse9)))))) (and (or .cse4 .cse5 .cse6) (or (forall ((~node~0.base Int)) (let ((.cse7 (select |c_#memory_int| ~node~0.base))) (or (= c_~update~0 (select .cse7 .cse8)) (not (= c_~update~0 (select .cse7 .cse9)))))) .cse5) (or (forall ((~node~0.base Int)) (let ((.cse10 (select |c_#memory_int| ~node~0.base))) (or (not (= c_~update~0 (select .cse10 .cse9))) (not (= c_~update~0 (select .cse10 .cse8)))))) (and (or (= (select .cse0 (+ .cse11 c_~manager~0.offset 4)) .cse12) .cse5) .cse13)) (or (= c_~update~0 .cse14) .cse4 .cse5)))) .cse15) (<= 0 c_~node_front~0) .cse16 (or (let ((.cse17 (= c_~update~0 (select .cse19 .cse8)))) (and (or (and (or .cse5 (= .cse12 .cse14)) .cse13) (not .cse17)) (or .cse18 .cse17))) .cse20) (or .cse18 .cse6) (= (select .cse19 .cse21) c_~update~0) (= c_~safe~0 1) (or .cse3 (and .cse2 (= c_~node_front~0 c_~node_back~0) .cse16 .cse6) .cse15) (= c_~node~0.offset 0)))))) is different from false [2023-09-01 13:22:55,207 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-09-01 13:22:57,223 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-09-01 13:22:59,228 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-09-01 13:23:01,241 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-09-01 13:23:03,247 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-09-01 13:23:05,250 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-09-01 13:23:07,272 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-09-01 13:23:09,284 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-09-01 13:23:11,286 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-09-01 13:23:13,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 [0, 1] [2023-09-01 13:23:15,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 [0, 1] [2023-09-01 13:23:17,375 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-09-01 13:23:19,386 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-09-01 13:23:21,395 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-09-01 13:23:23,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 [0, 1] [2023-09-01 13:23:25,404 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-09-01 13:23:27,408 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-09-01 13:23:29,411 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-09-01 13:23:31,413 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-09-01 13:23:33,417 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-09-01 13:23:35,421 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-09-01 13:23:37,424 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-09-01 13:23:39,427 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-09-01 13:23:41,430 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-09-01 13:23:43,437 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-09-01 13:23:57,791 WARN L222 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 78 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:23:59,914 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-09-01 13:24:01,918 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-09-01 13:24:03,921 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-09-01 13:24:05,926 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-09-01 13:24:07,936 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-09-01 13:24:08,254 INFO L130 PetriNetUnfolder]: 1319/2126 cut-off events. [2023-09-01 13:24:08,254 INFO L131 PetriNetUnfolder]: For 3960/3960 co-relation queries the response was YES. [2023-09-01 13:24:08,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 2126 events. 1319/2126 cut-off events. For 3960/3960 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9151 event pairs, 520 based on Foata normal form. 1/2127 useless extension candidates. Maximal degree in co-relation 7077. Up to 1249 conditions per place. [2023-09-01 13:24:08,299 INFO L137 encePairwiseOnDemand]: 477/495 looper letters, 117 selfloop transitions, 65 changer transitions 73/255 dead transitions. [2023-09-01 13:24:08,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 255 transitions, 1552 flow [2023-09-01 13:24:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-09-01 13:24:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-09-01 13:24:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 6641 transitions. [2023-09-01 13:24:08,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29165568730786123 [2023-09-01 13:24:08,316 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 6641 transitions. [2023-09-01 13:24:08,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 6641 transitions. [2023-09-01 13:24:08,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:24:08,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 6641 transitions. [2023-09-01 13:24:08,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 144.3695652173913) internal successors, (6641), 46 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:24:08,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 495.0) internal successors, (23265), 47 states have internal predecessors, (23265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:24:08,345 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 495.0) internal successors, (23265), 47 states have internal predecessors, (23265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:24:08,345 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 275 flow. Second operand 46 states and 6641 transitions. [2023-09-01 13:24:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 255 transitions, 1552 flow [2023-09-01 13:24:08,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 255 transitions, 1508 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-09-01 13:24:08,350 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 832 flow [2023-09-01 13:24:08,350 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=46, PETRI_FLOW=832, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2023-09-01 13:24:08,350 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 75 predicate places. [2023-09-01 13:24:08,350 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 832 flow [2023-09-01 13:24:08,351 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-09-01 13:24:08,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:24:08,352 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-09-01 13:24:08,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-09-01 13:24:08,557 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-09-01 13:24:08,557 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-09-01 13:24:08,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:24:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1225962343, now seen corresponding path program 3 times [2023-09-01 13:24:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:24:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272554363] [2023-09-01 13:24:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:24:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:24:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:24:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:24:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:24:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272554363] [2023-09-01 13:24:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272554363] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:24:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074738372] [2023-09-01 13:24:11,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:24:11,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:24:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:24:11,331 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-09-01 13:24:11,337 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-09-01 13:24:11,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-01 13:24:11,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:24:11,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 91 conjunts are in the unsatisfiable core [2023-09-01 13:24:11,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:24:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:24:12,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:24:33,504 WARN L222 SmtUtils]: Spent 20.07s 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-09-01 13:25:20,063 WARN L222 SmtUtils]: Spent 44.24s 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-09-01 13:25:20,174 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-09-01 13:25:20,175 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-09-01 13:25:20,273 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-09-01 13:25:20,273 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-09-01 13:25:20,356 INFO L321 Elim1Store]: treesize reduction 48, result has 69.2 percent of original size [2023-09-01 13:25:20,356 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-09-01 13:25:20,392 INFO L321 Elim1Store]: treesize reduction 153, result has 0.6 percent of original size [2023-09-01 13:25:20,392 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-09-01 13:25:20,425 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-09-01 13:25:20,426 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-09-01 13:25:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:25:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074738372] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:25:21,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:25:21,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 49 [2023-09-01 13:25:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495263244] [2023-09-01 13:25:21,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:25:21,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-09-01 13:25:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:25:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-09-01 13:25:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2078, Unknown=1, NotChecked=0, Total=2550 [2023-09-01 13:25:23,503 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-09-01 13:25:26,571 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-09-01 13:25:28,806 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-09-01 13:25:31,267 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-09-01 13:25:33,313 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-09-01 13:25:35,475 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-09-01 13:25:37,536 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-09-01 13:25:39,572 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-09-01 13:25:39,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 495 [2023-09-01 13:25:39,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 832 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-09-01 13:25:39,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:25:39,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 495 [2023-09-01 13:25:39,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:26:52,375 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-09-01 13:26:54,383 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-09-01 13:26:56,392 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-09-01 13:27:57,050 WARN L222 SmtUtils]: Spent 56.19s on a formula simplification. DAG size of input: 79 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:28:21,770 WARN L222 SmtUtils]: Spent 24.33s on a formula simplification. DAG size of input: 116 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:28:23,842 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-09-01 13:28:25,849 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-09-01 13:28:27,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:28:55,771 WARN L222 SmtUtils]: Spent 28.29s on a formula simplification. DAG size of input: 121 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:28:58,049 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-09-01 13:29:00,054 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-09-01 13:29:02,059 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-09-01 13:30:09,684 WARN L222 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 126 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:31:10,984 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-09-01 13:31:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-09-01 13:31:10,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-01 13:31:10,992 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-09-01 13:31:11,185 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-09-01 13:31:11,186 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.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) ... 60 more [2023-09-01 13:31:11,189 INFO L158 Benchmark]: Toolchain (without parser) took 856038.10ms. Allocated memory was 65.0MB in the beginning and 547.4MB in the end (delta: 482.3MB). Free memory was 42.2MB in the beginning and 235.5MB in the end (delta: -193.3MB). Peak memory consumption was 290.7MB. Max. memory is 16.1GB. [2023-09-01 13:31:11,189 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 65.0MB. Free memory is still 42.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 13:31:11,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.74ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 29.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-09-01 13:31:11,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.30ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 29.2MB in the beginning and 63.1MB in the end (delta: -33.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-09-01 13:31:11,190 INFO L158 Benchmark]: Boogie Preprocessor took 42.95ms. Allocated memory is still 83.9MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 13:31:11,190 INFO L158 Benchmark]: RCFGBuilder took 789.29ms. Allocated memory is still 83.9MB. Free memory was 61.0MB in the beginning and 52.5MB in the end (delta: 8.5MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2023-09-01 13:31:11,190 INFO L158 Benchmark]: TraceAbstraction took 854905.49ms. Allocated memory was 83.9MB in the beginning and 547.4MB in the end (delta: 463.5MB). Free memory was 52.1MB in the beginning and 235.5MB in the end (delta: -183.4MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. [2023-09-01 13:31:11,191 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 65.0MB. Free memory is still 42.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.74ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 29.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.30ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 29.2MB in the beginning and 63.1MB in the end (delta: -33.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.95ms. Allocated memory is still 83.9MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 789.29ms. Allocated memory is still 83.9MB. Free memory was 61.0MB in the beginning and 52.5MB in the end (delta: 8.5MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 854905.49ms. Allocated memory was 83.9MB in the beginning and 547.4MB in the end (delta: 463.5MB). Free memory was 52.1MB in the beginning and 235.5MB in the end (delta: -183.4MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:31:12,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:31:12,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:31:12,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:31:12,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:31:12,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:31:12,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:31:12,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:31:12,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:31:12,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:31:12,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:31:12,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:31:12,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:31:12,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:31:12,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:31:12,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:31:12,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:31:12,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:31:12,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:31:12,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:31:12,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:31:12,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:31:12,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:31:12,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:31:12,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:31:12,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:31:12,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:31:12,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:31:12,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:31:12,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:31:12,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:31:12,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:31:12,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:31:12,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:31:12,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:31:12,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:31:12,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:31:12,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:31:12,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:31:12,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:31:12,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:31:12,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-09-01 13:31:12,859 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:31:12,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:31:12,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:31:12,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:31:12,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:31:12,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:31:12,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:31:12,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:31:12,862 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:31:12,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:31:12,862 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:31:12,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:31:12,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:31:12,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:31:12,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:31:12,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:31:12,863 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 13:31:12,864 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-09-01 13:31:12,864 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-09-01 13:31:12,864 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:31:12,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:31:12,864 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:31:12,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:31:12,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:31:12,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:31:12,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:31:12,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:31:12,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:31:12,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:31:12,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:31:12,866 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-09-01 13:31:12,867 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:31:12,867 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 -> BEFORE [2023-09-01 13:31:13,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:31:13,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:31:13,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:31:13,130 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:31:13,130 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:31:13,131 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-09-01 13:31:14,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:31:14,331 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:31:14,331 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-09-01 13:31:14,336 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0277f178/3c3129a2b3b143868fd6a35abb5ddf9c/FLAG26a9e8e11 [2023-09-01 13:31:14,346 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0277f178/3c3129a2b3b143868fd6a35abb5ddf9c [2023-09-01 13:31:14,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:31:14,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:31:14,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:31:14,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:31:14,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:31:14,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b03c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14, skipping insertion in model container [2023-09-01 13:31:14,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:31:14,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:31:14,549 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-09-01 13:31:14,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:31:14,576 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-09-01 13:31:14,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:31:14,610 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-09-01 13:31:14,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:31:14,619 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:31:14,653 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-09-01 13:31:14,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:31:14,666 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:31:14,668 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:31:14,672 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:31:14,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14 WrapperNode [2023-09-01 13:31:14,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:31:14,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:31:14,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:31:14,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:31:14,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,731 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2023-09-01 13:31:14,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:31:14,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:31:14,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:31:14,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:31:14,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,760 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:31:14,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:31:14,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:31:14,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:31:14,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (1/1) ... [2023-09-01 13:31:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:31:14,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:31:14,791 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-09-01 13:31:14,816 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-09-01 13:31:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:31:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-09-01 13:31:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:31:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-09-01 13:31:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:31:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:31:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:31:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:31:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 13:31:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 13:31:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:31:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:31:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:31:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:31:14,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:31:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:31:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-09-01 13:31:14,837 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:31:14,948 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:31:14,949 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:31:15,328 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:31:15,457 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:31:15,457 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-09-01 13:31:15,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:31:15 BoogieIcfgContainer [2023-09-01 13:31:15,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:31:15,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:31:15,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:31:15,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:31:15,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:31:14" (1/3) ... [2023-09-01 13:31:15,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb4f5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:31:15, skipping insertion in model container [2023-09-01 13:31:15,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:14" (2/3) ... [2023-09-01 13:31:15,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb4f5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:31:15, skipping insertion in model container [2023-09-01 13:31:15,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:31:15" (3/3) ... [2023-09-01 13:31:15,464 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-09-01 13:31:15,469 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:31:15,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:31:15,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:31:15,475 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:31:15,560 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 13:31:15,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 237 transitions, 498 flow [2023-09-01 13:31:15,679 INFO L130 PetriNetUnfolder]: 19/234 cut-off events. [2023-09-01 13:31:15,679 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:31:15,683 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-09-01 13:31:15,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 237 transitions, 498 flow [2023-09-01 13:31:15,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 224 transitions, 466 flow [2023-09-01 13:31:15,703 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:31:15,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 224 transitions, 466 flow [2023-09-01 13:31:15,715 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 224 transitions, 466 flow [2023-09-01 13:31:15,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 224 transitions, 466 flow [2023-09-01 13:31:15,760 INFO L130 PetriNetUnfolder]: 19/224 cut-off events. [2023-09-01 13:31:15,760 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:31:15,767 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-09-01 13:31:15,769 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 Killed by 15