./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i -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 e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:17:13,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:17:13,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:17:13,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:17:13,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:17:13,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:17:13,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:17:13,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:17:13,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:17:13,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:17:13,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:17:13,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:17:13,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:17:13,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:17:13,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:17:13,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:17:13,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:17:13,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:17:13,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:17:13,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:17:13,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:17:13,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:17:13,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:17:13,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:17:13,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:17:13,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:17:13,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:17:13,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:17:13,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:17:13,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:17:13,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:17:13,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:17:13,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:17:13,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:17:13,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:17:13,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:17:13,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:17:13,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:17:13,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:17:13,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:17:13,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:17:13,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:17:13,354 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:17:13,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:17:13,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:17:13,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:17:13,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:17:13,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:17:13,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:17:13,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:17:13,357 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:17:13,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:17:13,358 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:17:13,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:17:13,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:17:13,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:17:13,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:17:13,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:17:13,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:17:13,359 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:17:13,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:17:13,360 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:17:13,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:17:13,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:17:13,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:17:13,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:17:13,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:17:13,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:17:13,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:17:13,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:17:13,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:17:13,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:17:13,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:17:13,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:17:13,362 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:17:13,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:17:13,362 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:17:13,362 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 -> e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:17:13,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:17:13,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:17:13,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:17:13,672 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:17:13,672 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:17:13,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2023-08-30 23:17:14,846 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:17:15,109 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:17:15,118 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2023-08-30 23:17:15,143 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b664564dc/2683b323aabf412e906810b45b3fb1e9/FLAGa589947b7 [2023-08-30 23:17:15,157 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b664564dc/2683b323aabf412e906810b45b3fb1e9 [2023-08-30 23:17:15,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:17:15,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:17:15,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:17:15,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:17:15,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:17:15,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ca4c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15, skipping insertion in model container [2023-08-30 23:17:15,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:17:15,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:17:15,331 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i[988,1001] [2023-08-30 23:17:15,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:17:15,543 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:17:15,553 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i[988,1001] [2023-08-30 23:17:15,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:17:15,664 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:17:15,665 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:17:15,671 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:17:15,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15 WrapperNode [2023-08-30 23:17:15,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:17:15,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:17:15,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:17:15,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:17:15,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,742 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-08-30 23:17:15,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:17:15,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:17:15,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:17:15,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:17:15,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,780 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:17:15,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:17:15,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:17:15,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:17:15,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (1/1) ... [2023-08-30 23:17:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:17:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:17:15,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:17:15,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:17:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:17:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:17:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:17:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:17:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:17:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:17:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:17:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:17:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:17:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:17:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:17:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:17:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:17:15,881 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:17:16,085 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:17:16,087 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:17:16,466 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:17:16,612 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:17:16,613 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:17:16,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:17:16 BoogieIcfgContainer [2023-08-30 23:17:16,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:17:16,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:17:16,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:17:16,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:17:16,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:17:15" (1/3) ... [2023-08-30 23:17:16,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f06663f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:17:16, skipping insertion in model container [2023-08-30 23:17:16,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:15" (2/3) ... [2023-08-30 23:17:16,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f06663f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:17:16, skipping insertion in model container [2023-08-30 23:17:16,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:17:16" (3/3) ... [2023-08-30 23:17:16,623 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2023-08-30 23:17:16,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:17:16,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:17:16,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:17:16,637 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:17:16,698 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:17:16,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2023-08-30 23:17:16,793 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2023-08-30 23:17:16,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:17:16,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-30 23:17:16,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2023-08-30 23:17:16,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2023-08-30 23:17:16,809 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:17:16,828 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2023-08-30 23:17:16,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2023-08-30 23:17:16,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2023-08-30 23:17:16,865 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2023-08-30 23:17:16,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:17:16,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-30 23:17:16,867 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-08-30 23:17:19,876 INFO L134 LiptonReduction]: Checked pairs total: 3678 [2023-08-30 23:17:19,877 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-08-30 23:17:19,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:17:19,893 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;@56cdfae1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:17:19,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 23:17:19,895 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 23:17:19,896 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:17:19,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:19,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:17:19,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:19,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 445221, now seen corresponding path program 1 times [2023-08-30 23:17:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007193487] [2023-08-30 23:17:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:20,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007193487] [2023-08-30 23:17:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007193487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:17:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890652655] [2023-08-30 23:17:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:20,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:17:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:20,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:17:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:17:20,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 173 [2023-08-30 23:17:20,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:20,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 173 [2023-08-30 23:17:20,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:20,467 INFO L130 PetriNetUnfolder]: 224/418 cut-off events. [2023-08-30 23:17:20,467 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 23:17:20,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 418 events. 224/418 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1927 event pairs, 20 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 809. Up to 333 conditions per place. [2023-08-30 23:17:20,473 INFO L137 encePairwiseOnDemand]: 169/173 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-30 23:17:20,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 125 flow [2023-08-30 23:17:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:17:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:17:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-08-30 23:17:20,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163776493256262 [2023-08-30 23:17:20,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-08-30 23:17:20,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-08-30 23:17:20,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:20,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-08-30 23:17:20,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,498 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 268 transitions. [2023-08-30 23:17:20,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 125 flow [2023-08-30 23:17:20,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:17:20,502 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2023-08-30 23:17:20,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-30 23:17:20,506 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-30 23:17:20,507 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 44 flow [2023-08-30 23:17:20,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:20,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:20,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:17:20,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:20,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash 21222427, now seen corresponding path program 1 times [2023-08-30 23:17:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:20,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922924919] [2023-08-30 23:17:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922924919] [2023-08-30 23:17:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922924919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:20,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:17:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346363096] [2023-08-30 23:17:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:20,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:17:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:17:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:17:20,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173 [2023-08-30 23:17:20,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:20,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173 [2023-08-30 23:17:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:20,981 INFO L130 PetriNetUnfolder]: 287/508 cut-off events. [2023-08-30 23:17:20,981 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-30 23:17:20,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 287/508 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1970 event pairs, 139 based on Foata normal form. 36/544 useless extension candidates. Maximal degree in co-relation 1058. Up to 417 conditions per place. [2023-08-30 23:17:20,984 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-30 23:17:20,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 180 flow [2023-08-30 23:17:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:17:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:17:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2023-08-30 23:17:20,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47167630057803467 [2023-08-30 23:17:20,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 408 transitions. [2023-08-30 23:17:20,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 408 transitions. [2023-08-30 23:17:20,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:20,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 408 transitions. [2023-08-30 23:17:20,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,993 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 44 flow. Second operand 5 states and 408 transitions. [2023-08-30 23:17:20,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 180 flow [2023-08-30 23:17:20,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:17:20,995 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 67 flow [2023-08-30 23:17:20,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 23:17:20,996 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-30 23:17:20,996 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 67 flow [2023-08-30 23:17:20,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:20,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:20,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:20,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:17:20,997 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:20,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 79521106, now seen corresponding path program 1 times [2023-08-30 23:17:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238648524] [2023-08-30 23:17:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238648524] [2023-08-30 23:17:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238648524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:21,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:21,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:17:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896160910] [2023-08-30 23:17:21,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:21,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:17:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:21,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:17:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:17:21,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 173 [2023-08-30 23:17:21,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:21,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 173 [2023-08-30 23:17:21,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:21,346 INFO L130 PetriNetUnfolder]: 203/364 cut-off events. [2023-08-30 23:17:21,346 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2023-08-30 23:17:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 364 events. 203/364 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1362 event pairs, 68 based on Foata normal form. 18/381 useless extension candidates. Maximal degree in co-relation 890. Up to 251 conditions per place. [2023-08-30 23:17:21,352 INFO L137 encePairwiseOnDemand]: 169/173 looper letters, 21 selfloop transitions, 3 changer transitions 10/35 dead transitions. [2023-08-30 23:17:21,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 171 flow [2023-08-30 23:17:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:17:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:17:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2023-08-30 23:17:21,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48554913294797686 [2023-08-30 23:17:21,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 420 transitions. [2023-08-30 23:17:21,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 420 transitions. [2023-08-30 23:17:21,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:21,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 420 transitions. [2023-08-30 23:17:21,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,359 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,359 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 67 flow. Second operand 5 states and 420 transitions. [2023-08-30 23:17:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 171 flow [2023-08-30 23:17:21,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 162 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 23:17:21,364 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 75 flow [2023-08-30 23:17:21,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-30 23:17:21,365 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2023-08-30 23:17:21,368 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 75 flow [2023-08-30 23:17:21,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:21,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:21,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:17:21,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:21,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2030473584, now seen corresponding path program 1 times [2023-08-30 23:17:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323864612] [2023-08-30 23:17:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323864612] [2023-08-30 23:17:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323864612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:17:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632253130] [2023-08-30 23:17:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:21,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:17:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:17:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:17:21,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173 [2023-08-30 23:17:21,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:21,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173 [2023-08-30 23:17:21,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:21,746 INFO L130 PetriNetUnfolder]: 225/402 cut-off events. [2023-08-30 23:17:21,746 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2023-08-30 23:17:21,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 402 events. 225/402 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1438 event pairs, 123 based on Foata normal form. 24/426 useless extension candidates. Maximal degree in co-relation 1002. Up to 277 conditions per place. [2023-08-30 23:17:21,749 INFO L137 encePairwiseOnDemand]: 169/173 looper letters, 25 selfloop transitions, 3 changer transitions 12/40 dead transitions. [2023-08-30 23:17:21,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 205 flow [2023-08-30 23:17:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:17:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:17:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2023-08-30 23:17:21,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46936416184971097 [2023-08-30 23:17:21,754 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 406 transitions. [2023-08-30 23:17:21,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 406 transitions. [2023-08-30 23:17:21,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:21,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 406 transitions. [2023-08-30 23:17:21,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,758 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,758 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 75 flow. Second operand 5 states and 406 transitions. [2023-08-30 23:17:21,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 205 flow [2023-08-30 23:17:21,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 191 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 23:17:21,761 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 78 flow [2023-08-30 23:17:21,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-30 23:17:21,762 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-08-30 23:17:21,762 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 78 flow [2023-08-30 23:17:21,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:21,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:21,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:17:21,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:21,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1633195207, now seen corresponding path program 1 times [2023-08-30 23:17:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026347086] [2023-08-30 23:17:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:22,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:22,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026347086] [2023-08-30 23:17:22,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026347086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:22,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:22,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:17:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831371087] [2023-08-30 23:17:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:22,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:17:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:17:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:17:22,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 173 [2023-08-30 23:17:22,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:22,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 173 [2023-08-30 23:17:22,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:22,138 INFO L130 PetriNetUnfolder]: 85/186 cut-off events. [2023-08-30 23:17:22,138 INFO L131 PetriNetUnfolder]: For 88/89 co-relation queries the response was YES. [2023-08-30 23:17:22,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 186 events. 85/186 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 651 event pairs, 17 based on Foata normal form. 28/213 useless extension candidates. Maximal degree in co-relation 463. Up to 77 conditions per place. [2023-08-30 23:17:22,139 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 24 selfloop transitions, 3 changer transitions 18/48 dead transitions. [2023-08-30 23:17:22,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 246 flow [2023-08-30 23:17:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:17:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:17:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-08-30 23:17:22,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913294797687861 [2023-08-30 23:17:22,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-08-30 23:17:22,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-08-30 23:17:22,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:22,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-08-30 23:17:22,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,145 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 78 flow. Second operand 5 states and 425 transitions. [2023-08-30 23:17:22,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 246 flow [2023-08-30 23:17:22,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 226 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 23:17:22,146 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 93 flow [2023-08-30 23:17:22,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-30 23:17:22,147 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-08-30 23:17:22,147 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 93 flow [2023-08-30 23:17:22,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:22,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:22,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:17:22,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:22,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1526004677, now seen corresponding path program 1 times [2023-08-30 23:17:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627098827] [2023-08-30 23:17:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:22,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627098827] [2023-08-30 23:17:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627098827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:17:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324158651] [2023-08-30 23:17:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:22,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:17:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:17:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:17:22,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 173 [2023-08-30 23:17:22,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:22,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 173 [2023-08-30 23:17:22,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:22,501 INFO L130 PetriNetUnfolder]: 32/87 cut-off events. [2023-08-30 23:17:22,501 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-30 23:17:22,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 87 events. 32/87 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 13 based on Foata normal form. 9/95 useless extension candidates. Maximal degree in co-relation 242. Up to 41 conditions per place. [2023-08-30 23:17:22,502 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 22 selfloop transitions, 5 changer transitions 9/39 dead transitions. [2023-08-30 23:17:22,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 217 flow [2023-08-30 23:17:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:17:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:17:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2023-08-30 23:17:22,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749518304431599 [2023-08-30 23:17:22,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 493 transitions. [2023-08-30 23:17:22,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 493 transitions. [2023-08-30 23:17:22,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:22,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 493 transitions. [2023-08-30 23:17:22,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,510 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,510 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 93 flow. Second operand 6 states and 493 transitions. [2023-08-30 23:17:22,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 217 flow [2023-08-30 23:17:22,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 190 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-30 23:17:22,513 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 92 flow [2023-08-30 23:17:22,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-30 23:17:22,515 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2023-08-30 23:17:22,515 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 92 flow [2023-08-30 23:17:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:22,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:22,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:22,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:17:22,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:22,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1506654891, now seen corresponding path program 1 times [2023-08-30 23:17:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:22,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809862913] [2023-08-30 23:17:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809862913] [2023-08-30 23:17:23,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809862913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:23,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:23,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:17:23,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109550825] [2023-08-30 23:17:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:23,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:17:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:23,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:17:23,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:17:23,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173 [2023-08-30 23:17:23,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:23,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:23,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173 [2023-08-30 23:17:23,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:24,002 INFO L130 PetriNetUnfolder]: 26/81 cut-off events. [2023-08-30 23:17:24,002 INFO L131 PetriNetUnfolder]: For 60/61 co-relation queries the response was YES. [2023-08-30 23:17:24,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 81 events. 26/81 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 218 event pairs, 0 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 220. Up to 25 conditions per place. [2023-08-30 23:17:24,003 INFO L137 encePairwiseOnDemand]: 165/173 looper letters, 27 selfloop transitions, 6 changer transitions 12/48 dead transitions. [2023-08-30 23:17:24,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 285 flow [2023-08-30 23:17:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:17:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:17:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 698 transitions. [2023-08-30 23:17:24,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482980089916506 [2023-08-30 23:17:24,006 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 698 transitions. [2023-08-30 23:17:24,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 698 transitions. [2023-08-30 23:17:24,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:24,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 698 transitions. [2023-08-30 23:17:24,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,011 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,012 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 92 flow. Second operand 9 states and 698 transitions. [2023-08-30 23:17:24,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 285 flow [2023-08-30 23:17:24,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 252 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 23:17:24,014 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 96 flow [2023-08-30 23:17:24,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-08-30 23:17:24,015 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2023-08-30 23:17:24,015 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 96 flow [2023-08-30 23:17:24,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:24,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:24,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:17:24,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:24,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -556602077, now seen corresponding path program 2 times [2023-08-30 23:17:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59551672] [2023-08-30 23:17:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:17:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:17:24,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:17:24,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59551672] [2023-08-30 23:17:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59551672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:17:24,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:17:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:17:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896755218] [2023-08-30 23:17:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:17:24,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:17:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:17:24,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:17:24,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:17:24,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-08-30 23:17:24,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:17:24,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-08-30 23:17:24,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:17:24,433 INFO L130 PetriNetUnfolder]: 32/100 cut-off events. [2023-08-30 23:17:24,433 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-30 23:17:24,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 100 events. 32/100 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 294 event pairs, 13 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 300. Up to 43 conditions per place. [2023-08-30 23:17:24,434 INFO L137 encePairwiseOnDemand]: 169/173 looper letters, 18 selfloop transitions, 1 changer transitions 17/37 dead transitions. [2023-08-30 23:17:24,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 235 flow [2023-08-30 23:17:24,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:17:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:17:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2023-08-30 23:17:24,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46936416184971097 [2023-08-30 23:17:24,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 406 transitions. [2023-08-30 23:17:24,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 406 transitions. [2023-08-30 23:17:24,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:17:24,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 406 transitions. [2023-08-30 23:17:24,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,440 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 96 flow. Second operand 5 states and 406 transitions. [2023-08-30 23:17:24,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 235 flow [2023-08-30 23:17:24,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 207 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-30 23:17:24,441 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 81 flow [2023-08-30 23:17:24,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-08-30 23:17:24,442 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2023-08-30 23:17:24,442 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 81 flow [2023-08-30 23:17:24,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:17:24,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:17:24,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:24,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:17:24,443 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:17:24,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:17:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1170744731, now seen corresponding path program 3 times [2023-08-30 23:17:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:17:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546722671] [2023-08-30 23:17:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:17:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:17:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:17:24,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:17:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:17:24,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:17:24,592 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:17:24,593 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 23:17:24,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 23:17:24,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 23:17:24,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 23:17:24,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 23:17:24,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:17:24,602 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-30 23:17:24,608 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:17:24,608 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:17:24,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:17:24 BasicIcfg [2023-08-30 23:17:24,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:17:24,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:17:24,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:17:24,692 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:17:24,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:17:16" (3/4) ... [2023-08-30 23:17:24,694 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:17:24,781 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:17:24,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:17:24,782 INFO L158 Benchmark]: Toolchain (without parser) took 9622.76ms. Allocated memory was 71.3MB in the beginning and 247.5MB in the end (delta: 176.2MB). Free memory was 46.2MB in the beginning and 199.6MB in the end (delta: -153.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,783 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 48.6MB in the beginning and 48.6MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:17:24,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.36ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 46.1MB in the beginning and 60.3MB in the end (delta: -14.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.19ms. Allocated memory is still 92.3MB. Free memory was 60.3MB in the beginning and 57.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,784 INFO L158 Benchmark]: Boogie Preprocessor took 41.33ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 55.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,784 INFO L158 Benchmark]: RCFGBuilder took 830.06ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 48.2MB in the end (delta: 7.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,785 INFO L158 Benchmark]: TraceAbstraction took 8074.33ms. Allocated memory was 92.3MB in the beginning and 247.5MB in the end (delta: 155.2MB). Free memory was 47.7MB in the beginning and 208.0MB in the end (delta: -160.2MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,785 INFO L158 Benchmark]: Witness Printer took 89.74ms. Allocated memory is still 247.5MB. Free memory was 208.0MB in the beginning and 199.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 23:17:24,787 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.19ms. Allocated memory is still 71.3MB. Free memory was 48.6MB in the beginning and 48.6MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.36ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 46.1MB in the beginning and 60.3MB in the end (delta: -14.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.19ms. Allocated memory is still 92.3MB. Free memory was 60.3MB in the beginning and 57.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.33ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 55.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 830.06ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 48.2MB in the end (delta: 7.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8074.33ms. Allocated memory was 92.3MB in the beginning and 247.5MB in the end (delta: 155.2MB). Free memory was 47.7MB in the beginning and 208.0MB in the end (delta: -160.2MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Witness Printer took 89.74ms. Allocated memory is still 247.5MB. Free memory was 208.0MB in the beginning and 199.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 95 PlacesBefore, 27 PlacesAfterwards, 90 TransitionsBefore, 21 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 3678 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1366, independent: 1201, independent conditional: 0, independent unconditional: 1201, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 662, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1366, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 662, unknown conditional: 0, unknown unconditional: 662] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=-1, t1721={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1722; [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1722, ((void *)0), P1, ((void *)0))=0, t1721={5:0}, t1722={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L759] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L760] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L761] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L762] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L764] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L798] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L799] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L800] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L801] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L803] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721={5:0}, t1722={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 27 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:17:24,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE