./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:11:56,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:11:56,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:11:56,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:11:56,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:11:56,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:11:56,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:11:56,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:11:56,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:11:56,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:11:56,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:11:56,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:11:56,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:11:56,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:11:56,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:11:56,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:11:56,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:11:56,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:11:56,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:11:56,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:11:56,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:11:56,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:11:56,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:11:56,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:11:56,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:11:56,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:11:56,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:11:56,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:11:56,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:11:56,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:11:56,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:11:56,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:11:56,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:11:56,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:11:56,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:11:56,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:11:56,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:11:56,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:11:56,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:11:56,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:11:56,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:11:56,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:11:56,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce [2024-11-07 11:11:56,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:11:56,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:11:56,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:11:56,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:11:56,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:11:56,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-11-07 11:11:57,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:11:58,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:11:58,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-11-07 11:11:58,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0c830c2c/cf981a73b67740f0a7936e360a7b73f5/FLAG2f01861a9 [2024-11-07 11:11:58,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0c830c2c/cf981a73b67740f0a7936e360a7b73f5 [2024-11-07 11:11:58,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:11:58,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:11:58,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:11:58,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:11:58,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:11:58,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c93bf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58, skipping insertion in model container [2024-11-07 11:11:58,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:11:58,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i[999,1012] [2024-11-07 11:11:58,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:11:58,755 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:11:58,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i[999,1012] [2024-11-07 11:11:58,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:11:58,861 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:11:58,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58 WrapperNode [2024-11-07 11:11:58,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:11:58,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:11:58,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:11:58,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:11:58,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,921 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2024-11-07 11:11:58,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:11:58,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:11:58,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:11:58,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:11:58,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,960 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 11:11:58,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:11:58,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:11:58,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:11:58,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:11:58,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (1/1) ... [2024-11-07 11:11:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:11:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:11:59,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:11:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:11:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:11:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:11:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 11:11:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 11:11:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 11:11:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 11:11:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:11:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:11:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:11:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:11:59,057 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:11:59,205 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:11:59,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:11:59,490 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:11:59,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:11:59,650 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:11:59,651 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:11:59,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:11:59 BoogieIcfgContainer [2024-11-07 11:11:59,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:11:59,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:11:59,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:11:59,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:11:59,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:11:58" (1/3) ... [2024-11-07 11:11:59,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775e1f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:11:59, skipping insertion in model container [2024-11-07 11:11:59,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:58" (2/3) ... [2024-11-07 11:11:59,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775e1f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:11:59, skipping insertion in model container [2024-11-07 11:11:59,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:11:59" (3/3) ... [2024-11-07 11:11:59,660 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2024-11-07 11:11:59,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:11:59,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 11:11:59,673 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:11:59,718 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:11:59,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow [2024-11-07 11:11:59,786 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2024-11-07 11:11:59,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:11:59,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-11-07 11:11:59,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow [2024-11-07 11:11:59,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow [2024-11-07 11:11:59,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:11:59,820 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e091c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:11:59,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-07 11:11:59,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:11:59,829 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-07 11:11:59,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:11:59,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:11:59,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 11:11:59,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:11:59,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:11:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash 627402401, now seen corresponding path program 1 times [2024-11-07 11:11:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:11:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301324232] [2024-11-07 11:11:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:11:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:11:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301324232] [2024-11-07 11:12:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301324232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 11:12:00,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912980682] [2024-11-07 11:12:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:00,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:12:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:12:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:12:00,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 32 [2024-11-07 11:12:00,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-07 11:12:00,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:00,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 32 [2024-11-07 11:12:00,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:00,571 INFO L124 PetriNetUnfolderBase]: 95/268 cut-off events. [2024-11-07 11:12:00,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:12:00,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 268 events. 95/268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1414 event pairs, 14 based on Foata normal form. 12/271 useless extension candidates. Maximal degree in co-relation 444. Up to 136 conditions per place. [2024-11-07 11:12:00,576 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 17 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2024-11-07 11:12:00,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 118 flow [2024-11-07 11:12:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:12:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:12:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-07 11:12:00,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-07 11:12:00,592 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 72 transitions. [2024-11-07 11:12:00,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 118 flow [2024-11-07 11:12:00,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:12:00,599 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 62 flow [2024-11-07 11:12:00,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-07 11:12:00,604 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-07 11:12:00,605 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 62 flow [2024-11-07 11:12:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-07 11:12:00,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:00,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:12:00,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:12:00,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -320842990, now seen corresponding path program 1 times [2024-11-07 11:12:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901315969] [2024-11-07 11:12:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901315969] [2024-11-07 11:12:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901315969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:12:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697642330] [2024-11-07 11:12:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:12:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:12:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:12:00,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-07 11:12:00,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-11-07 11:12:00,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:00,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-07 11:12:00,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:01,097 INFO L124 PetriNetUnfolderBase]: 142/334 cut-off events. [2024-11-07 11:12:01,098 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-07 11:12:01,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 334 events. 142/334 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1696 event pairs, 24 based on Foata normal form. 20/330 useless extension candidates. Maximal degree in co-relation 625. Up to 133 conditions per place. [2024-11-07 11:12:01,102 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 27 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-11-07 11:12:01,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 164 flow [2024-11-07 11:12:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:12:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:12:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-07 11:12:01,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.671875 [2024-11-07 11:12:01,106 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 62 flow. Second operand 4 states and 86 transitions. [2024-11-07 11:12:01,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 164 flow [2024-11-07 11:12:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:12:01,108 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 84 flow [2024-11-07 11:12:01,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-07 11:12:01,109 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-07 11:12:01,110 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 84 flow [2024-11-07 11:12:01,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-11-07 11:12:01,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:01,110 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:12:01,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:12:01,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:01,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash 443300838, now seen corresponding path program 1 times [2024-11-07 11:12:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:01,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177108291] [2024-11-07 11:12:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177108291] [2024-11-07 11:12:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177108291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:01,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:01,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:12:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895882707] [2024-11-07 11:12:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:01,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:12:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:12:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:12:01,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-07 11:12:01,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) [2024-11-07 11:12:01,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:01,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-07 11:12:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:01,567 INFO L124 PetriNetUnfolderBase]: 80/186 cut-off events. [2024-11-07 11:12:01,568 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-07 11:12:01,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 186 events. 80/186 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 649 event pairs, 16 based on Foata normal form. 14/188 useless extension candidates. Maximal degree in co-relation 421. Up to 71 conditions per place. [2024-11-07 11:12:01,570 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 6 changer transitions 1/41 dead transitions. [2024-11-07 11:12:01,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 173 flow [2024-11-07 11:12:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:12:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:12:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-11-07 11:12:01,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.60625 [2024-11-07 11:12:01,575 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 84 flow. Second operand 5 states and 97 transitions. [2024-11-07 11:12:01,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 173 flow [2024-11-07 11:12:01,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:12:01,578 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 100 flow [2024-11-07 11:12:01,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2024-11-07 11:12:01,579 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2024-11-07 11:12:01,580 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 100 flow [2024-11-07 11:12:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) [2024-11-07 11:12:01,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:01,580 INFO L204 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] [2024-11-07 11:12:01,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:12:01,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 452557551, now seen corresponding path program 1 times [2024-11-07 11:12:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140499847] [2024-11-07 11:12:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:02,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:02,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140499847] [2024-11-07 11:12:02,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140499847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:02,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:12:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368096575] [2024-11-07 11:12:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:02,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:12:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:12:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:12:02,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-07 11:12:02,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 100 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 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) [2024-11-07 11:12:02,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-07 11:12:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:02,989 INFO L124 PetriNetUnfolderBase]: 130/313 cut-off events. [2024-11-07 11:12:02,989 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-07 11:12:02,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 313 events. 130/313 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1266 event pairs, 32 based on Foata normal form. 4/312 useless extension candidates. Maximal degree in co-relation 686. Up to 132 conditions per place. [2024-11-07 11:12:02,996 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 26 selfloop transitions, 12 changer transitions 18/67 dead transitions. [2024-11-07 11:12:02,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 298 flow [2024-11-07 11:12:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 11:12:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 11:12:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-11-07 11:12:03,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2024-11-07 11:12:03,002 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 100 flow. Second operand 11 states and 178 transitions. [2024-11-07 11:12:03,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 298 flow [2024-11-07 11:12:03,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 264 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-07 11:12:03,006 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 145 flow [2024-11-07 11:12:03,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=145, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-11-07 11:12:03,007 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2024-11-07 11:12:03,008 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 145 flow [2024-11-07 11:12:03,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 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) [2024-11-07 11:12:03,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:03,009 INFO L204 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] [2024-11-07 11:12:03,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:12:03,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:03,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2297467, now seen corresponding path program 2 times [2024-11-07 11:12:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711911594] [2024-11-07 11:12:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:03,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:03,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711911594] [2024-11-07 11:12:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711911594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:03,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:03,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:12:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526711220] [2024-11-07 11:12:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:03,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:12:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:12:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:12:03,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-07 11:12:03,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 145 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 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) [2024-11-07 11:12:03,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:03,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-07 11:12:03,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:04,286 INFO L124 PetriNetUnfolderBase]: 124/307 cut-off events. [2024-11-07 11:12:04,287 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-07 11:12:04,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 307 events. 124/307 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1280 event pairs, 20 based on Foata normal form. 4/304 useless extension candidates. Maximal degree in co-relation 708. Up to 130 conditions per place. [2024-11-07 11:12:04,289 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 27 selfloop transitions, 12 changer transitions 14/64 dead transitions. [2024-11-07 11:12:04,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 317 flow [2024-11-07 11:12:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 11:12:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 11:12:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-11-07 11:12:04,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-11-07 11:12:04,292 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 145 flow. Second operand 10 states and 162 transitions. [2024-11-07 11:12:04,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 317 flow [2024-11-07 11:12:04,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 305 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-07 11:12:04,297 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 183 flow [2024-11-07 11:12:04,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2024-11-07 11:12:04,298 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2024-11-07 11:12:04,298 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 183 flow [2024-11-07 11:12:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 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) [2024-11-07 11:12:04,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:04,298 INFO L204 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] [2024-11-07 11:12:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:12:04,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -467136507, now seen corresponding path program 3 times [2024-11-07 11:12:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740488631] [2024-11-07 11:12:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740488631] [2024-11-07 11:12:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740488631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:04,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:04,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:12:04,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433129968] [2024-11-07 11:12:04,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:04,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:12:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:04,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:12:04,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:12:04,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-07 11:12:04,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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) [2024-11-07 11:12:04,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:04,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-07 11:12:04,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:04,783 INFO L124 PetriNetUnfolderBase]: 127/316 cut-off events. [2024-11-07 11:12:04,783 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-07 11:12:04,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 316 events. 127/316 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1330 event pairs, 37 based on Foata normal form. 4/308 useless extension candidates. Maximal degree in co-relation 806. Up to 120 conditions per place. [2024-11-07 11:12:04,785 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 19 selfloop transitions, 3 changer transitions 30/63 dead transitions. [2024-11-07 11:12:04,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 372 flow [2024-11-07 11:12:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:12:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:12:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-11-07 11:12:04,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51953125 [2024-11-07 11:12:04,788 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 183 flow. Second operand 8 states and 133 transitions. [2024-11-07 11:12:04,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 372 flow [2024-11-07 11:12:04,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 317 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-11-07 11:12:04,792 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 105 flow [2024-11-07 11:12:04,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2024-11-07 11:12:04,795 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-11-07 11:12:04,796 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 105 flow [2024-11-07 11:12:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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) [2024-11-07 11:12:04,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:04,797 INFO L204 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] [2024-11-07 11:12:04,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:12:04,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:04,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash -358246425, now seen corresponding path program 4 times [2024-11-07 11:12:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:04,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415613586] [2024-11-07 11:12:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:12:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:12:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:12:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415613586] [2024-11-07 11:12:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415613586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:12:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:12:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:12:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315401779] [2024-11-07 11:12:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:12:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:12:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:12:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:12:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:12:05,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-07 11:12:05,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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) [2024-11-07 11:12:05,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:12:05,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-07 11:12:05,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:12:05,506 INFO L124 PetriNetUnfolderBase]: 67/193 cut-off events. [2024-11-07 11:12:05,506 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-07 11:12:05,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 193 events. 67/193 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 697 event pairs, 8 based on Foata normal form. 4/190 useless extension candidates. Maximal degree in co-relation 409. Up to 37 conditions per place. [2024-11-07 11:12:05,510 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 16 selfloop transitions, 4 changer transitions 14/48 dead transitions. [2024-11-07 11:12:05,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 217 flow [2024-11-07 11:12:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:12:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:12:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-11-07 11:12:05,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2024-11-07 11:12:05,512 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 105 flow. Second operand 9 states and 161 transitions. [2024-11-07 11:12:05,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 217 flow [2024-11-07 11:12:05,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 185 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-11-07 11:12:05,514 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 97 flow [2024-11-07 11:12:05,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=97, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2024-11-07 11:12:05,514 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2024-11-07 11:12:05,515 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 97 flow [2024-11-07 11:12:05,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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) [2024-11-07 11:12:05,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:12:05,516 INFO L204 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] [2024-11-07 11:12:05,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:12:05,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:12:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:12:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -297929659, now seen corresponding path program 5 times [2024-11-07 11:12:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:12:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257866781] [2024-11-07 11:12:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:12:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:12:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:12:05,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:12:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:12:05,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:12:05,652 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:12:05,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-07 11:12:05,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-07 11:12:05,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-07 11:12:05,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-07 11:12:05,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-07 11:12:05,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:12:05,655 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2024-11-07 11:12:05,730 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:12:05,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:12:05,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:12:05 BasicIcfg [2024-11-07 11:12:05,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:12:05,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:12:05,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:12:05,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:12:05,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:11:59" (3/4) ... [2024-11-07 11:12:05,742 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:12:05,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:12:05,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:12:05,821 INFO L158 Benchmark]: Toolchain (without parser) took 7398.41ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 75.6MB in the beginning and 164.7MB in the end (delta: -89.1MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-07 11:12:05,822 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:12:05,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.94ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 53.3MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 11:12:05,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.11ms. Allocated memory is still 100.7MB. Free memory was 53.1MB in the beginning and 51.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:12:05,822 INFO L158 Benchmark]: Boogie Preprocessor took 59.74ms. Allocated memory is still 100.7MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:12:05,823 INFO L158 Benchmark]: RCFGBuilder took 665.44ms. Allocated memory is still 100.7MB. Free memory was 48.5MB in the beginning and 52.6MB in the end (delta: -4.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-07 11:12:05,823 INFO L158 Benchmark]: TraceAbstraction took 6086.10ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 52.0MB in the beginning and 173.1MB in the end (delta: -121.1MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-11-07 11:12:05,823 INFO L158 Benchmark]: Witness Printer took 80.02ms. Allocated memory is still 226.5MB. Free memory was 173.1MB in the beginning and 164.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:12:05,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.94ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 53.3MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.11ms. Allocated memory is still 100.7MB. Free memory was 53.1MB in the beginning and 51.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.74ms. Allocated memory is still 100.7MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 665.44ms. Allocated memory is still 100.7MB. Free memory was 48.5MB in the beginning and 52.6MB in the end (delta: -4.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6086.10ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 52.0MB in the beginning and 173.1MB in the end (delta: -121.1MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Witness Printer took 80.02ms. Allocated memory is still 226.5MB. Free memory was 173.1MB in the beginning and 164.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 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: 5.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 852 IncrementalHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 32 mSDtfsCounter, 852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=5, InterpolantAutomatonStates: 50, 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.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2024-11-07 11:12:05,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE