./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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 ../sv-benchmarks/c/pthread-wmm/rfi008.opt.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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:25:28,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:25:28,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:25:28,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:25:28,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:25:28,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:25:28,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:25:28,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:25:28,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:25:28,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:25:28,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:25:28,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:25:28,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:25:28,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:25:28,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:25:28,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:25:28,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:25:28,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:25:28,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:25:28,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:25:28,498 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:25:28,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:25:28,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:25:28,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:25:28,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:25:28,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:25:28,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:25:28,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:25:28,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:25:28,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:25:28,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:25:28,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:25:28,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:25:28,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:25:28,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:25:28,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:25:28,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:25:28,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:25:28,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:25:28,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:25:28,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:25:28,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:25:28,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:25:28,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:25:28,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:25:28,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:25:28,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:25:28,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:25:28,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:25:28,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:25:28,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:25:28,548 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:25:28,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:25:28,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:25:28,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:25:28,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:25:28,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:25:28,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:25:28,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:25:28,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:25:28,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:25:28,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:25:28,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:25:28,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:25:28,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:25:28,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:25:28,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:25:28,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:25:28,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:25:28,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:25:28,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:25:28,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:25:28,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:25:28,553 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:25:28,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:25:28,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:25:28,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-07-22 21:25:28,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:25:28,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:25:28,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:25:28,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:25:28,820 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:25:28,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-07-22 21:25:28,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38ed63df/8aa99b523d394d1c8fe3e0c2ec5db4cf/FLAGa10a768c8 [2022-07-22 21:25:29,342 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:25:29,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-07-22 21:25:29,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38ed63df/8aa99b523d394d1c8fe3e0c2ec5db4cf/FLAGa10a768c8 [2022-07-22 21:25:29,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38ed63df/8aa99b523d394d1c8fe3e0c2ec5db4cf [2022-07-22 21:25:29,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:25:29,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:25:29,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:25:29,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:25:29,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:25:29,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:25:29" (1/1) ... [2022-07-22 21:25:29,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6146178a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:29, skipping insertion in model container [2022-07-22 21:25:29,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:25:29" (1/1) ... [2022-07-22 21:25:29,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:25:29,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:25:29,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-07-22 21:25:30,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:25:30,077 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:25:30,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-07-22 21:25:30,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:25:30,188 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:25:30,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30 WrapperNode [2022-07-22 21:25:30,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:25:30,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:25:30,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:25:30,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:25:30,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,271 INFO L137 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 265 [2022-07-22 21:25:30,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:25:30,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:25:30,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:25:30,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:25:30,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:25:30,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:25:30,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:25:30,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:25:30,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (1/1) ... [2022-07-22 21:25:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:25:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:25:30,381 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) [2022-07-22 21:25:30,400 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 [2022-07-22 21:25:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:25:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:25:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:25:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:25:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:25:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:25:30,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:25:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:25:30,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:25:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:25:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:25:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:25:30,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:25:30,424 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:25:30,605 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:25:30,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:25:31,177 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:25:31,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:25:31,464 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:25:31,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:31 BoogieIcfgContainer [2022-07-22 21:25:31,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:25:31,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:25:31,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:25:31,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:25:31,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:25:29" (1/3) ... [2022-07-22 21:25:31,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74885007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:25:31, skipping insertion in model container [2022-07-22 21:25:31,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:30" (2/3) ... [2022-07-22 21:25:31,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74885007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:25:31, skipping insertion in model container [2022-07-22 21:25:31,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:31" (3/3) ... [2022-07-22 21:25:31,474 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-07-22 21:25:31,479 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:25:31,487 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:25:31,487 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:25:31,488 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:25:31,545 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:25:31,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-07-22 21:25:31,605 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2022-07-22 21:25:31,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:25:31,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-07-22 21:25:31,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-07-22 21:25:31,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-07-22 21:25:31,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:25:31,626 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63b39f11, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42792ac [2022-07-22 21:25:31,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-22 21:25:31,637 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2022-07-22 21:25:31,638 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:25:31,638 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:31,639 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:31,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1117316809, now seen corresponding path program 1 times [2022-07-22 21:25:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:31,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567658277] [2022-07-22 21:25:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:31,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567658277] [2022-07-22 21:25:31,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567658277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:31,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:31,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:25:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784766275] [2022-07-22 21:25:31,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:31,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:25:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:25:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:25:31,964 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2022-07-22 21:25:31,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:31,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:31,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2022-07-22 21:25:31,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:32,073 INFO L129 PetriNetUnfolder]: 14/169 cut-off events. [2022-07-22 21:25:32,074 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:25:32,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 169 events. 14/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 413 event pairs, 6 based on Foata normal form. 6/164 useless extension candidates. Maximal degree in co-relation 162. Up to 25 conditions per place. [2022-07-22 21:25:32,077 INFO L132 encePairwiseOnDemand]: 93/98 looper letters, 8 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-07-22 21:25:32,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 214 flow [2022-07-22 21:25:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:25:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:25:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-07-22 21:25:32,089 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2022-07-22 21:25:32,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2022-07-22 21:25:32,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2022-07-22 21:25:32,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:32,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2022-07-22 21:25:32,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,103 INFO L186 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 273 transitions. [2022-07-22 21:25:32,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 214 flow [2022-07-22 21:25:32,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:25:32,109 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-07-22 21:25:32,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-07-22 21:25:32,114 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-07-22 21:25:32,115 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-07-22 21:25:32,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,116 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:32,116 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:32,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:25:32,116 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:32,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash -392497808, now seen corresponding path program 1 times [2022-07-22 21:25:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:32,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007666589] [2022-07-22 21:25:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:32,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:32,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007666589] [2022-07-22 21:25:32,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007666589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:32,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269220980] [2022-07-22 21:25:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:32,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:32,377 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-07-22 21:25:32,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:32,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-07-22 21:25:32,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:32,774 INFO L129 PetriNetUnfolder]: 210/742 cut-off events. [2022-07-22 21:25:32,774 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-07-22 21:25:32,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 742 events. 210/742 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4295 event pairs, 34 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 1116. Up to 189 conditions per place. [2022-07-22 21:25:32,779 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 23 selfloop transitions, 2 changer transitions 49/137 dead transitions. [2022-07-22 21:25:32,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 428 flow [2022-07-22 21:25:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:25:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:25:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 733 transitions. [2022-07-22 21:25:32,787 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8310657596371882 [2022-07-22 21:25:32,788 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 733 transitions. [2022-07-22 21:25:32,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 733 transitions. [2022-07-22 21:25:32,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:32,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 733 transitions. [2022-07-22 21:25:32,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.44444444444444) internal successors, (733), 9 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,798 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,798 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 733 transitions. [2022-07-22 21:25:32,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 428 flow [2022-07-22 21:25:32,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 137 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:25:32,803 INFO L242 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-07-22 21:25:32,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-07-22 21:25:32,804 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-22 21:25:32,804 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-07-22 21:25:32,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:32,805 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:32,805 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:32,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:25:32,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash -492284146, now seen corresponding path program 1 times [2022-07-22 21:25:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:32,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731112699] [2022-07-22 21:25:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731112699] [2022-07-22 21:25:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731112699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:32,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:32,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801930631] [2022-07-22 21:25:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:32,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:33,000 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-07-22 21:25:33,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:33,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-07-22 21:25:33,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:33,286 INFO L129 PetriNetUnfolder]: 113/346 cut-off events. [2022-07-22 21:25:33,287 INFO L130 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-07-22 21:25:33,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 346 events. 113/346 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1299 event pairs, 31 based on Foata normal form. 10/340 useless extension candidates. Maximal degree in co-relation 640. Up to 106 conditions per place. [2022-07-22 21:25:33,289 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 18 selfloop transitions, 4 changer transitions 25/110 dead transitions. [2022-07-22 21:25:33,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 110 transitions, 359 flow [2022-07-22 21:25:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 789 transitions. [2022-07-22 21:25:33,292 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8051020408163265 [2022-07-22 21:25:33,293 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 789 transitions. [2022-07-22 21:25:33,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 789 transitions. [2022-07-22 21:25:33,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:33,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 789 transitions. [2022-07-22 21:25:33,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.9) internal successors, (789), 10 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,299 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,300 INFO L186 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 10 states and 789 transitions. [2022-07-22 21:25:33,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 110 transitions, 359 flow [2022-07-22 21:25:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 110 transitions, 325 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-22 21:25:33,308 INFO L242 Difference]: Finished difference. Result has 104 places, 82 transitions, 196 flow [2022-07-22 21:25:33,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=196, PETRI_PLACES=104, PETRI_TRANSITIONS=82} [2022-07-22 21:25:33,311 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-07-22 21:25:33,311 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 82 transitions, 196 flow [2022-07-22 21:25:33,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,312 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:33,313 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:33,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:25:33,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 396581961, now seen corresponding path program 1 times [2022-07-22 21:25:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643927052] [2022-07-22 21:25:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:33,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643927052] [2022-07-22 21:25:33,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643927052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:33,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:33,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:25:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116970348] [2022-07-22 21:25:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:33,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:25:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:25:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:25:33,460 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-07-22 21:25:33,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 82 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:33,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-07-22 21:25:33,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:33,790 INFO L129 PetriNetUnfolder]: 155/450 cut-off events. [2022-07-22 21:25:33,791 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-07-22 21:25:33,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 450 events. 155/450 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2162 event pairs, 14 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 831. Up to 79 conditions per place. [2022-07-22 21:25:33,793 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 24 selfloop transitions, 5 changer transitions 40/134 dead transitions. [2022-07-22 21:25:33,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 134 transitions, 461 flow [2022-07-22 21:25:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 841 transitions. [2022-07-22 21:25:33,797 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8581632653061224 [2022-07-22 21:25:33,797 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 841 transitions. [2022-07-22 21:25:33,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 841 transitions. [2022-07-22 21:25:33,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:33,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 841 transitions. [2022-07-22 21:25:33,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,806 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,806 INFO L186 Difference]: Start difference. First operand has 104 places, 82 transitions, 196 flow. Second operand 10 states and 841 transitions. [2022-07-22 21:25:33,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 134 transitions, 461 flow [2022-07-22 21:25:33,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 427 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-22 21:25:33,810 INFO L242 Difference]: Finished difference. Result has 104 places, 83 transitions, 218 flow [2022-07-22 21:25:33,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=218, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2022-07-22 21:25:33,812 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-07-22 21:25:33,812 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 218 flow [2022-07-22 21:25:33,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,814 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:33,814 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:33,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:25:33,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1163297030, now seen corresponding path program 1 times [2022-07-22 21:25:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:33,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081065225] [2022-07-22 21:25:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081065225] [2022-07-22 21:25:33,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081065225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:33,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:33,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482132897] [2022-07-22 21:25:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:33,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:33,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:33,968 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-07-22 21:25:33,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:33,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:33,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-07-22 21:25:33,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:34,174 INFO L129 PetriNetUnfolder]: 33/173 cut-off events. [2022-07-22 21:25:34,174 INFO L130 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-07-22 21:25:34,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 173 events. 33/173 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 433 event pairs, 7 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 356. Up to 26 conditions per place. [2022-07-22 21:25:34,176 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 16 selfloop transitions, 7 changer transitions 19/107 dead transitions. [2022-07-22 21:25:34,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 398 flow [2022-07-22 21:25:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2022-07-22 21:25:34,180 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8306122448979592 [2022-07-22 21:25:34,180 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2022-07-22 21:25:34,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2022-07-22 21:25:34,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:34,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2022-07-22 21:25:34,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,186 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,187 INFO L186 Difference]: Start difference. First operand has 104 places, 83 transitions, 218 flow. Second operand 10 states and 814 transitions. [2022-07-22 21:25:34,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 398 flow [2022-07-22 21:25:34,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 352 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-07-22 21:25:34,193 INFO L242 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow [2022-07-22 21:25:34,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2022-07-22 21:25:34,196 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-07-22 21:25:34,196 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow [2022-07-22 21:25:34,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,197 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:34,197 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:34,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:25:34,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:34,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1607326295, now seen corresponding path program 1 times [2022-07-22 21:25:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:34,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451500423] [2022-07-22 21:25:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451500423] [2022-07-22 21:25:34,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451500423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:34,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:34,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 21:25:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790475652] [2022-07-22 21:25:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:34,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:25:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:25:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:25:34,488 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 98 [2022-07-22 21:25:34,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 72.3) internal successors, (723), 10 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:34,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 98 [2022-07-22 21:25:34,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:34,840 INFO L129 PetriNetUnfolder]: 25/242 cut-off events. [2022-07-22 21:25:34,840 INFO L130 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-07-22 21:25:34,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 242 events. 25/242 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 859 event pairs, 2 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 421. Up to 37 conditions per place. [2022-07-22 21:25:34,842 INFO L132 encePairwiseOnDemand]: 84/98 looper letters, 33 selfloop transitions, 13 changer transitions 12/118 dead transitions. [2022-07-22 21:25:34,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 414 flow [2022-07-22 21:25:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:25:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:25:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1040 transitions. [2022-07-22 21:25:34,846 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7580174927113703 [2022-07-22 21:25:34,846 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1040 transitions. [2022-07-22 21:25:34,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1040 transitions. [2022-07-22 21:25:34,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:34,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1040 transitions. [2022-07-22 21:25:34,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 74.28571428571429) internal successors, (1040), 14 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 98.0) internal successors, (1470), 15 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,854 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 98.0) internal successors, (1470), 15 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,854 INFO L186 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 14 states and 1040 transitions. [2022-07-22 21:25:34,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 414 flow [2022-07-22 21:25:34,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 118 transitions, 368 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-07-22 21:25:34,859 INFO L242 Difference]: Finished difference. Result has 112 places, 91 transitions, 267 flow [2022-07-22 21:25:34,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=267, PETRI_PLACES=112, PETRI_TRANSITIONS=91} [2022-07-22 21:25:34,862 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-22 21:25:34,862 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 91 transitions, 267 flow [2022-07-22 21:25:34,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.3) internal successors, (723), 10 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:34,863 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:34,863 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:34,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:25:34,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash -671371529, now seen corresponding path program 2 times [2022-07-22 21:25:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:34,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422517478] [2022-07-22 21:25:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:35,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422517478] [2022-07-22 21:25:35,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422517478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:35,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:35,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 21:25:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070621451] [2022-07-22 21:25:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 21:25:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 21:25:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 21:25:35,257 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 98 [2022-07-22 21:25:35,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 91 transitions, 267 flow. Second operand has 12 states, 12 states have (on average 72.83333333333333) internal successors, (874), 12 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:35,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:35,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 98 [2022-07-22 21:25:35,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:35,647 INFO L129 PetriNetUnfolder]: 14/242 cut-off events. [2022-07-22 21:25:35,648 INFO L130 PetriNetUnfolder]: For 64/70 co-relation queries the response was YES. [2022-07-22 21:25:35,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 242 events. 14/242 cut-off events. For 64/70 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 960 event pairs, 1 based on Foata normal form. 2/242 useless extension candidates. Maximal degree in co-relation 434. Up to 23 conditions per place. [2022-07-22 21:25:35,649 INFO L132 encePairwiseOnDemand]: 87/98 looper letters, 18 selfloop transitions, 8 changer transitions 10/101 dead transitions. [2022-07-22 21:25:35,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 101 transitions, 396 flow [2022-07-22 21:25:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:25:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:25:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 883 transitions. [2022-07-22 21:25:35,652 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7508503401360545 [2022-07-22 21:25:35,653 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 883 transitions. [2022-07-22 21:25:35,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 883 transitions. [2022-07-22 21:25:35,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:35,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 883 transitions. [2022-07-22 21:25:35,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.58333333333333) internal successors, (883), 12 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:35,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 98.0) internal successors, (1274), 13 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:35,658 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 98.0) internal successors, (1274), 13 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:35,658 INFO L186 Difference]: Start difference. First operand has 112 places, 91 transitions, 267 flow. Second operand 12 states and 883 transitions. [2022-07-22 21:25:35,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 101 transitions, 396 flow [2022-07-22 21:25:35,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 101 transitions, 372 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-07-22 21:25:35,662 INFO L242 Difference]: Finished difference. Result has 115 places, 91 transitions, 282 flow [2022-07-22 21:25:35,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=282, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2022-07-22 21:25:35,663 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 14 predicate places. [2022-07-22 21:25:35,663 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 282 flow [2022-07-22 21:25:35,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 72.83333333333333) internal successors, (874), 12 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:35,664 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:35,664 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:35,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:25:35,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 363677201, now seen corresponding path program 3 times [2022-07-22 21:25:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970562688] [2022-07-22 21:25:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:35,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970562688] [2022-07-22 21:25:35,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970562688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:35,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:35,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:25:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462083636] [2022-07-22 21:25:35,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:35,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:25:35,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:25:35,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:25:35,868 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 98 [2022-07-22 21:25:35,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 74.625) internal successors, (597), 8 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:35,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:35,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 98 [2022-07-22 21:25:35,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:36,022 INFO L129 PetriNetUnfolder]: 20/247 cut-off events. [2022-07-22 21:25:36,022 INFO L130 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-07-22 21:25:36,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 247 events. 20/247 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 965 event pairs, 5 based on Foata normal form. 2/247 useless extension candidates. Maximal degree in co-relation 512. Up to 41 conditions per place. [2022-07-22 21:25:36,024 INFO L132 encePairwiseOnDemand]: 88/98 looper letters, 16 selfloop transitions, 5 changer transitions 18/101 dead transitions. [2022-07-22 21:25:36,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 410 flow [2022-07-22 21:25:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:25:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:25:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 611 transitions. [2022-07-22 21:25:36,026 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7793367346938775 [2022-07-22 21:25:36,026 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 611 transitions. [2022-07-22 21:25:36,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 611 transitions. [2022-07-22 21:25:36,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:36,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 611 transitions. [2022-07-22 21:25:36,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:36,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:36,031 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:36,031 INFO L186 Difference]: Start difference. First operand has 115 places, 91 transitions, 282 flow. Second operand 8 states and 611 transitions. [2022-07-22 21:25:36,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 410 flow [2022-07-22 21:25:36,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 377 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-07-22 21:25:36,034 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 229 flow [2022-07-22 21:25:36,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2022-07-22 21:25:36,036 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-22 21:25:36,037 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 229 flow [2022-07-22 21:25:36,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.625) internal successors, (597), 8 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:36,037 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:36,037 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:36,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:25:36,038 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash 976104011, now seen corresponding path program 4 times [2022-07-22 21:25:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:36,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966507701] [2022-07-22 21:25:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:25:36,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:25:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:25:36,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:25:36,243 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:25:36,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-22 21:25:36,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-22 21:25:36,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-22 21:25:36,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-22 21:25:36,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-22 21:25:36,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:25:36,247 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-07-22 21:25:36,257 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:25:36,257 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:25:36,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:25:36 BasicIcfg [2022-07-22 21:25:36,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:25:36,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:25:36,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:25:36,372 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:25:36,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:31" (3/4) ... [2022-07-22 21:25:36,374 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:25:36,464 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:25:36,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:25:36,465 INFO L158 Benchmark]: Toolchain (without parser) took 6806.29ms. Allocated memory was 94.4MB in the beginning and 195.0MB in the end (delta: 100.7MB). Free memory was 60.9MB in the beginning and 143.7MB in the end (delta: -82.8MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,465 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:25:36,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.58ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 60.7MB in the beginning and 86.5MB in the end (delta: -25.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.17ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 83.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,466 INFO L158 Benchmark]: Boogie Preprocessor took 68.60ms. Allocated memory is still 125.8MB. Free memory was 83.6MB in the beginning and 81.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,467 INFO L158 Benchmark]: RCFGBuilder took 1123.15ms. Allocated memory is still 125.8MB. Free memory was 81.1MB in the beginning and 81.1MB in the end (delta: -19.8kB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,467 INFO L158 Benchmark]: TraceAbstraction took 4903.23ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 80.2MB in the beginning and 58.1MB in the end (delta: 22.1MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,467 INFO L158 Benchmark]: Witness Printer took 92.56ms. Allocated memory is still 195.0MB. Free memory was 58.1MB in the beginning and 143.7MB in the end (delta: -85.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 21:25:36,469 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.58ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 60.7MB in the beginning and 86.5MB in the end (delta: -25.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.17ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 83.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.60ms. Allocated memory is still 125.8MB. Free memory was 83.6MB in the beginning and 81.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.15ms. Allocated memory is still 125.8MB. Free memory was 81.1MB in the beginning and 81.1MB in the end (delta: -19.8kB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4903.23ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 80.2MB in the beginning and 58.1MB in the end (delta: 22.1MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. * Witness Printer took 92.56ms. Allocated memory is still 195.0MB. Free memory was 58.1MB in the beginning and 143.7MB in the end (delta: -85.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 pthread_t t1723; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=-1, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L789] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 827]: 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: 829]: 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, 117 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: 4.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 78 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=7, InterpolantAutomatonStates: 76, 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.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 21:25:36,508 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