./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix041_power.oepc_pso.oepc_rmo.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 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:50:49,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:49,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:49,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:49,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:49,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:49,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:49,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:49,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:49,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:49,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:49,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:49,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:49,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:49,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:49,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:49,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:49,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:49,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:49,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:49,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:49,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:49,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:49,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:49,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:49,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:49,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:49,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:49,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:49,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:49,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:49,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:49,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:49,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:49,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:49,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:49,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:49,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:49,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:49,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:49,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:49,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:50:49,415 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:49,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:49,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:49,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:49,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:49,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:49,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:49,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:49,418 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:49,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:49,419 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:49,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:49,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:49,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:49,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:49,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:49,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:49,420 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:49,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:49,421 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:49,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:49,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:49,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:49,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:49,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:49,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:49,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:49,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:49,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:49,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:49,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:49,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:49,423 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:49,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:49,423 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:49,424 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 -> 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:50:49,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:49,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:49,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:49,740 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:49,740 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:49,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:50:51,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:51,285 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:51,286 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:50:51,299 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1f151c2/3f8d856b84de4465a8b9e2b7adbcf618/FLAGc8d5817ca [2023-08-30 16:50:51,314 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1f151c2/3f8d856b84de4465a8b9e2b7adbcf618 [2023-08-30 16:50:51,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:51,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:51,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:51,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:51,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:51,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2326fb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51, skipping insertion in model container [2023-08-30 16:50:51,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:51,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:51,518 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:50:51,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:51,741 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:51,753 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/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:50:51,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:51,849 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:51,849 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:51,855 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:51,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51 WrapperNode [2023-08-30 16:50:51,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:51,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:51,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:51,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:51,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,923 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-08-30 16:50:51,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:51,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:51,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:51,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:51,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,971 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:51,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:51,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:51,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:51,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (1/1) ... [2023-08-30 16:50:51,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:52,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:52,042 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 16:50:52,066 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 16:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:52,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:52,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:52,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:52,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:52,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:52,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:52,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:52,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:52,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:52,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:52,100 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 16:50:52,246 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:52,247 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:52,486 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:52,627 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:52,628 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:52,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:52 BoogieIcfgContainer [2023-08-30 16:50:52,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:52,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:52,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:52,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:52,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:51" (1/3) ... [2023-08-30 16:50:52,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c5a429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:52, skipping insertion in model container [2023-08-30 16:50:52,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:51" (2/3) ... [2023-08-30 16:50:52,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c5a429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:52, skipping insertion in model container [2023-08-30 16:50:52,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:52" (3/3) ... [2023-08-30 16:50:52,638 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:50:52,645 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:52,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:52,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:52,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:52,694 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:52,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-08-30 16:50:52,773 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-08-30 16:50:52,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:52,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-30 16:50:52,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-08-30 16:50:52,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-08-30 16:50:52,788 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:52,809 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-30 16:50:52,815 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-30 16:50:52,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-08-30 16:50:52,849 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-08-30 16:50:52,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:52,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-30 16:50:52,851 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-08-30 16:50:55,680 INFO L134 LiptonReduction]: Checked pairs total: 3011 [2023-08-30 16:50:55,681 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-30 16:50:55,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:55,704 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;@693f13d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:55,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:50:55,708 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:50:55,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:55,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:55,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:50:55,709 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 16:50:55,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 408543, now seen corresponding path program 1 times [2023-08-30 16:50:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194730427] [2023-08-30 16:50:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:56,114 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 16:50:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:56,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194730427] [2023-08-30 16:50:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194730427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055744792] [2023-08-30 16:50:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:56,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:56,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 170 [2023-08-30 16:50:56,156 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 16:50:56,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:56,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 170 [2023-08-30 16:50:56,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:56,341 INFO L130 PetriNetUnfolder]: 249/470 cut-off events. [2023-08-30 16:50:56,341 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 16:50:56,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 470 events. 249/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2148 event pairs, 30 based on Foata normal form. 24/446 useless extension candidates. Maximal degree in co-relation 900. Up to 352 conditions per place. [2023-08-30 16:50:56,349 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 25 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2023-08-30 16:50:56,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow [2023-08-30 16:50:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-30 16:50:56,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313725490196078 [2023-08-30 16:50:56,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-30 16:50:56,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-30 16:50:56,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:56,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-30 16:50:56,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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 16:50:56,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 16:50:56,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 16:50:56,382 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 271 transitions. [2023-08-30 16:50:56,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow [2023-08-30 16:50:56,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:56,386 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-30 16:50:56,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, 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=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-30 16:50:56,393 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-30 16:50:56,393 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-30 16:50:56,394 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 16:50:56,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:56,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:56,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:56,397 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 16:50:56,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1756126342, now seen corresponding path program 1 times [2023-08-30 16:50:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277439543] [2023-08-30 16:50:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:56,746 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 16:50:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277439543] [2023-08-30 16:50:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277439543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:56,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:56,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595863144] [2023-08-30 16:50:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:56,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:56,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-08-30 16:50:56,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 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 16:50:56,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:56,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-08-30 16:50:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:56,948 INFO L130 PetriNetUnfolder]: 332/603 cut-off events. [2023-08-30 16:50:56,948 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-30 16:50:56,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 603 events. 332/603 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2739 event pairs, 86 based on Foata normal form. 45/648 useless extension candidates. Maximal degree in co-relation 1248. Up to 321 conditions per place. [2023-08-30 16:50:56,952 INFO L137 encePairwiseOnDemand]: 163/170 looper letters, 23 selfloop transitions, 5 changer transitions 18/46 dead transitions. [2023-08-30 16:50:56,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 46 transitions, 198 flow [2023-08-30 16:50:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2023-08-30 16:50:56,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858823529411765 [2023-08-30 16:50:56,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 413 transitions. [2023-08-30 16:50:56,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 413 transitions. [2023-08-30 16:50:56,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:56,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 413 transitions. [2023-08-30 16:50:56,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 16:50:56,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 16:50:56,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 16:50:56,960 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 413 transitions. [2023-08-30 16:50:56,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 46 transitions, 198 flow [2023-08-30 16:50:56,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:56,962 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow [2023-08-30 16:50:56,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 16:50:56,963 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-30 16:50:56,963 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow [2023-08-30 16:50:56,963 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 16:50:56,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:56,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:56,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:56,964 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 16:50:56,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1394633125, now seen corresponding path program 1 times [2023-08-30 16:50:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841964263] [2023-08-30 16:50:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:57,132 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 16:50:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841964263] [2023-08-30 16:50:57,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841964263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:57,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:57,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704693258] [2023-08-30 16:50:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:57,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:57,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 170 [2023-08-30 16:50:57,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 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 16:50:57,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:57,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 170 [2023-08-30 16:50:57,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:57,268 INFO L130 PetriNetUnfolder]: 258/490 cut-off events. [2023-08-30 16:50:57,269 INFO L131 PetriNetUnfolder]: For 316/321 co-relation queries the response was YES. [2023-08-30 16:50:57,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 490 events. 258/490 cut-off events. For 316/321 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2181 event pairs, 97 based on Foata normal form. 39/524 useless extension candidates. Maximal degree in co-relation 1270. Up to 339 conditions per place. [2023-08-30 16:50:57,272 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 20 selfloop transitions, 3 changer transitions 13/38 dead transitions. [2023-08-30 16:50:57,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 208 flow [2023-08-30 16:50:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2023-08-30 16:50:57,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929411764705882 [2023-08-30 16:50:57,274 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions. [2023-08-30 16:50:57,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions. [2023-08-30 16:50:57,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:57,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions. [2023-08-30 16:50:57,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 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 16:50:57,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 16:50:57,278 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 16:50:57,278 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 5 states and 419 transitions. [2023-08-30 16:50:57,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 208 flow [2023-08-30 16:50:57,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 188 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:57,282 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 83 flow [2023-08-30 16:50:57,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=68, 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=83, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-30 16:50:57,282 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2023-08-30 16:50:57,283 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 83 flow [2023-08-30 16:50:57,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 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 16:50:57,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:57,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:57,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:57,284 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 16:50:57,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1233607448, now seen corresponding path program 1 times [2023-08-30 16:50:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:57,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156460253] [2023-08-30 16:50:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156460253] [2023-08-30 16:50:57,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156460253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240869380] [2023-08-30 16:50:57,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:57,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:57,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:57,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 170 [2023-08-30 16:50:57,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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 16:50:57,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:57,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 170 [2023-08-30 16:50:57,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:57,622 INFO L130 PetriNetUnfolder]: 73/179 cut-off events. [2023-08-30 16:50:57,623 INFO L131 PetriNetUnfolder]: For 95/96 co-relation queries the response was YES. [2023-08-30 16:50:57,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 179 events. 73/179 cut-off events. For 95/96 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 644 event pairs, 21 based on Foata normal form. 23/201 useless extension candidates. Maximal degree in co-relation 476. Up to 127 conditions per place. [2023-08-30 16:50:57,624 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-30 16:50:57,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 187 flow [2023-08-30 16:50:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-08-30 16:50:57,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2023-08-30 16:50:57,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-08-30 16:50:57,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-08-30 16:50:57,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:57,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-08-30 16:50:57,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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 16:50:57,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 16:50:57,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 16:50:57,629 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 83 flow. Second operand 3 states and 258 transitions. [2023-08-30 16:50:57,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 187 flow [2023-08-30 16:50:57,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 171 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 16:50:57,631 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 90 flow [2023-08-30 16:50:57,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=3, PETRI_FLOW=90, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2023-08-30 16:50:57,631 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-30 16:50:57,632 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 90 flow [2023-08-30 16:50:57,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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 16:50:57,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:57,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:57,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:50:57,633 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 16:50:57,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 34550546, now seen corresponding path program 1 times [2023-08-30 16:50:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:57,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945204667] [2023-08-30 16:50:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:57,932 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 16:50:57,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:57,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945204667] [2023-08-30 16:50:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945204667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:57,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121695922] [2023-08-30 16:50:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:57,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:57,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:57,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 170 [2023-08-30 16:50:57,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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 16:50:57,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:57,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 170 [2023-08-30 16:50:57,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:57,997 INFO L130 PetriNetUnfolder]: 31/90 cut-off events. [2023-08-30 16:50:57,997 INFO L131 PetriNetUnfolder]: For 19/20 co-relation queries the response was YES. [2023-08-30 16:50:57,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 90 events. 31/90 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 256 event pairs, 13 based on Foata normal form. 14/103 useless extension candidates. Maximal degree in co-relation 259. Up to 47 conditions per place. [2023-08-30 16:50:57,998 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 24 selfloop transitions, 5 changer transitions 1/32 dead transitions. [2023-08-30 16:50:57,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 186 flow [2023-08-30 16:50:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2023-08-30 16:50:58,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2023-08-30 16:50:58,000 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 335 transitions. [2023-08-30 16:50:58,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 335 transitions. [2023-08-30 16:50:58,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:58,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 335 transitions. [2023-08-30 16:50:58,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 16:50:58,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,003 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,003 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 90 flow. Second operand 4 states and 335 transitions. [2023-08-30 16:50:58,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 186 flow [2023-08-30 16:50:58,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 170 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:58,005 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 94 flow [2023-08-30 16:50:58,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=4, PETRI_FLOW=94, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-30 16:50:58,006 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-30 16:50:58,006 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 94 flow [2023-08-30 16:50:58,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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 16:50:58,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:58,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:58,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:50:58,007 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 16:50:58,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 104746922, now seen corresponding path program 1 times [2023-08-30 16:50:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132510152] [2023-08-30 16:50:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:58,517 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 16:50:58,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:58,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132510152] [2023-08-30 16:50:58,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132510152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:58,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:58,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:58,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047056552] [2023-08-30 16:50:58,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:58,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:58,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:58,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:58,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:58,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 170 [2023-08-30 16:50:58,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:58,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 170 [2023-08-30 16:50:58,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:58,779 INFO L130 PetriNetUnfolder]: 42/126 cut-off events. [2023-08-30 16:50:58,779 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-08-30 16:50:58,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 126 events. 42/126 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 422 event pairs, 4 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 374. Up to 38 conditions per place. [2023-08-30 16:50:58,780 INFO L137 encePairwiseOnDemand]: 159/170 looper letters, 18 selfloop transitions, 9 changer transitions 32/59 dead transitions. [2023-08-30 16:50:58,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 59 transitions, 373 flow [2023-08-30 16:50:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:50:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:50:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 606 transitions. [2023-08-30 16:50:58,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4455882352941177 [2023-08-30 16:50:58,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 606 transitions. [2023-08-30 16:50:58,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 606 transitions. [2023-08-30 16:50:58,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:58,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 606 transitions. [2023-08-30 16:50:58,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.75) internal successors, (606), 8 states have internal predecessors, (606), 0 states have call successors, (0), 0 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 16:50:58,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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 16:50:58,788 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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 16:50:58,788 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 94 flow. Second operand 8 states and 606 transitions. [2023-08-30 16:50:58,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 59 transitions, 373 flow [2023-08-30 16:50:58,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 59 transitions, 344 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:58,790 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 137 flow [2023-08-30 16:50:58,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-30 16:50:58,791 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2023-08-30 16:50:58,791 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 137 flow [2023-08-30 16:50:58,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:58,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:58,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:50:58,792 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 16:50:58,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1566882144, now seen corresponding path program 2 times [2023-08-30 16:50:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521997897] [2023-08-30 16:50:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:58,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:50:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:58,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:50:58,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:50:58,902 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:50:58,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:50:58,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:50:58,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:50:58,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:50:58,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:50:58,905 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-30 16:50:58,910 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:50:58,910 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:50:58,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:50:58 BasicIcfg [2023-08-30 16:50:58,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:50:58,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:50:58,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:50:58,950 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:50:58,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:52" (3/4) ... [2023-08-30 16:50:58,951 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:50:59,028 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:50:59,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:50:59,029 INFO L158 Benchmark]: Toolchain (without parser) took 7711.74ms. Allocated memory was 71.3MB in the beginning and 195.0MB in the end (delta: 123.7MB). Free memory was 43.4MB in the beginning and 107.6MB in the end (delta: -64.2MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,029 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 34.8MB in the beginning and 34.8MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:50:59,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.57ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 38.3MB in the end (delta: 4.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.52ms. Allocated memory is still 71.3MB. Free memory was 38.3MB in the beginning and 35.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,030 INFO L158 Benchmark]: Boogie Preprocessor took 62.29ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 34.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,030 INFO L158 Benchmark]: RCFGBuilder took 642.70ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 34.1MB in the beginning and 71.4MB in the end (delta: -37.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,031 INFO L158 Benchmark]: TraceAbstraction took 6316.96ms. Allocated memory was 102.8MB in the beginning and 195.0MB in the end (delta: 92.3MB). Free memory was 70.9MB in the beginning and 114.9MB in the end (delta: -44.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,031 INFO L158 Benchmark]: Witness Printer took 79.37ms. Allocated memory is still 195.0MB. Free memory was 114.9MB in the beginning and 107.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 16:50:59,033 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.20ms. Allocated memory is still 56.6MB. Free memory was 34.8MB in the beginning and 34.8MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.57ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 38.3MB in the end (delta: 4.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.52ms. Allocated memory is still 71.3MB. Free memory was 38.3MB in the beginning and 35.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.29ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 34.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.70ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 34.1MB in the beginning and 71.4MB in the end (delta: -37.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6316.96ms. Allocated memory was 102.8MB in the beginning and 195.0MB in the end (delta: 92.3MB). Free memory was 70.9MB in the beginning and 114.9MB in the end (delta: -44.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 79.37ms. Allocated memory is still 195.0MB. Free memory was 114.9MB in the beginning and 107.6MB in the end (delta: 7.3MB). 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: 2.9s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 3011 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1285, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 608, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1285, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 608, unknown conditional: 0, unknown unconditional: 608] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1089, ((void *)0), P0, ((void *)0))=-1, t1089={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1090, ((void *)0), P1, ((void *)0))=0, t1089={5:0}, t1090={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089={5:0}, t1090={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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, 111 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: 6.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 37 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=6, InterpolantAutomatonStates: 28, 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, 1.5s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 16:50:59,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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