./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 09:13:15,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:13:16,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:13:16,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:13:16,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:13:16,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:13:16,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:13:16,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:13:16,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:13:16,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:13:16,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:13:16,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:13:16,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:13:16,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:13:16,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:13:16,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:13:16,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:13:16,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:13:16,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:13:16,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:13:16,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:13:16,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:13:16,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:13:16,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:13:16,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:13:16,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:13:16,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:13:16,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:13:16,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:13:16,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:13:16,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:13:16,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:13:16,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:13:16,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:13:16,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:13:16,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:13:16,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:13:16,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:13:16,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:13:16,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:13:16,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:13:16,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 09:13:16,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:13:16,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:13:16,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:13:16,091 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:13:16,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:13:16,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:13:16,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:13:16,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:13:16,093 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:13:16,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:13:16,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:13:16,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:13:16,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:13:16,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:13:16,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 09:13:16,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:13:16,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 09:13:16,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:13:16,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 09:13:16,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:13:16,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 09:13:16,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:13:16,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:13:16,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:13:16,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:13:16,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:13:16,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:13:16,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 09:13:16,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:13:16,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:13:16,099 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 09:13:16,099 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 09:13:16,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 09:13:16,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce [2022-11-21 09:13:16,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:13:16,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:13:16,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:13:16,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:13:16,420 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:13:16,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-11-21 09:13:19,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:13:19,766 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:13:19,766 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-11-21 09:13:19,785 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/data/6e4f7f064/efb79fe79dd44bbb8c03a00d7a88af34/FLAG183d96aa0 [2022-11-21 09:13:19,813 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/data/6e4f7f064/efb79fe79dd44bbb8c03a00d7a88af34 [2022-11-21 09:13:19,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:13:19,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:13:19,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:13:19,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:13:19,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:13:19,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:13:19" (1/1) ... [2022-11-21 09:13:19,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b3af83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:19, skipping insertion in model container [2022-11-21 09:13:19,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:13:19" (1/1) ... [2022-11-21 09:13:19,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:13:19,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:13:20,219 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i[999,1012] [2022-11-21 09:13:20,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:13:20,454 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:13:20,469 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i[999,1012] [2022-11-21 09:13:20,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:13:20,589 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:13:20,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20 WrapperNode [2022-11-21 09:13:20,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:13:20,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:13:20,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:13:20,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:13:20,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,669 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-11-21 09:13:20,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:13:20,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:13:20,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:13:20,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:13:20,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,720 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:13:20,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:13:20,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:13:20,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:13:20,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (1/1) ... [2022-11-21 09:13:20,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:13:20,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:13:20,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:13:20,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:13:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 09:13:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 09:13:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:13:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 09:13:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:13:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 09:13:20,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 09:13:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 09:13:20,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 09:13:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:13:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 09:13:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:13:20,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:13:20,820 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 09:13:21,008 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:13:21,010 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:13:21,376 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:13:21,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:13:21,549 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 09:13:21,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:13:21 BoogieIcfgContainer [2022-11-21 09:13:21,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:13:21,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:13:21,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:13:21,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:13:21,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:13:19" (1/3) ... [2022-11-21 09:13:21,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35815dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:13:21, skipping insertion in model container [2022-11-21 09:13:21,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:13:20" (2/3) ... [2022-11-21 09:13:21,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35815dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:13:21, skipping insertion in model container [2022-11-21 09:13:21,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:13:21" (3/3) ... [2022-11-21 09:13:21,563 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2022-11-21 09:13:21,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 09:13:21,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:13:21,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 09:13:21,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 09:13:21,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 09:13:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-21 09:13:21,735 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-21 09:13:21,735 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 09:13:21,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-21 09:13:21,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-11-21 09:13:21,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-11-21 09:13:21,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:13:21,763 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c35229c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:13:21,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-21 09:13:21,780 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-11-21 09:13:21,780 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 09:13:21,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:21,781 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:21,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1419897952, now seen corresponding path program 1 times [2022-11-21 09:13:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:21,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062520911] [2022-11-21 09:13:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:13:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:13:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:13:22,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062520911] [2022-11-21 09:13:22,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062520911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:13:22,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:13:22,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:13:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32085893] [2022-11-21 09:13:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:13:22,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:13:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:13:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:13:22,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:13:22,583 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 98 [2022-11-21 09:13:22,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:22,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:13:22,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 98 [2022-11-21 09:13:22,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:13:22,685 INFO L130 PetriNetUnfolder]: 10/162 cut-off events. [2022-11-21 09:13:22,685 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 09:13:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 162 events. 10/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 339 event pairs, 4 based on Foata normal form. 6/159 useless extension candidates. Maximal degree in co-relation 147. Up to 17 conditions per place. [2022-11-21 09:13:22,690 INFO L137 encePairwiseOnDemand]: 93/98 looper letters, 7 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-11-21 09:13:22,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 212 flow [2022-11-21 09:13:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:13:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 09:13:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2022-11-21 09:13:22,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2022-11-21 09:13:22,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2022-11-21 09:13:22,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2022-11-21 09:13:22,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:13:22,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2022-11-21 09:13:22,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:22,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:22,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:22,732 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 275 transitions. [2022-11-21 09:13:22,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 212 flow [2022-11-21 09:13:22,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 09:13:22,744 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-11-21 09:13:22,746 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-11-21 09:13:22,751 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-11-21 09:13:22,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-11-21 09:13:22,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:22,752 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:22,752 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:22,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:13:22,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1176006288, now seen corresponding path program 1 times [2022-11-21 09:13:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:22,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855923918] [2022-11-21 09:13:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:13:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:13:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:13:23,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855923918] [2022-11-21 09:13:23,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855923918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:13:23,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:13:23,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:13:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273539620] [2022-11-21 09:13:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:13:23,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:13:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:13:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:13:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:13:23,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 98 [2022-11-21 09:13:23,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:23,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:13:23,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 98 [2022-11-21 09:13:23,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:13:23,558 INFO L130 PetriNetUnfolder]: 84/381 cut-off events. [2022-11-21 09:13:23,558 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-21 09:13:23,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 381 events. 84/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1839 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 522. Up to 65 conditions per place. [2022-11-21 09:13:23,562 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 14 selfloop transitions, 2 changer transitions 34/118 dead transitions. [2022-11-21 09:13:23,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 332 flow [2022-11-21 09:13:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 09:13:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 09:13:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 754 transitions. [2022-11-21 09:13:23,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2022-11-21 09:13:23,571 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 754 transitions. [2022-11-21 09:13:23,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 754 transitions. [2022-11-21 09:13:23,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:13:23,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 754 transitions. [2022-11-21 09:13:23,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:23,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:23,582 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:23,582 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 754 transitions. [2022-11-21 09:13:23,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 332 flow [2022-11-21 09:13:23,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 09:13:23,587 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-11-21 09:13:23,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-11-21 09:13:23,588 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-11-21 09:13:23,588 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-11-21 09:13:23,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:23,589 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:23,589 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:23,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:13:23,591 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash 560299375, now seen corresponding path program 1 times [2022-11-21 09:13:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:23,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119160359] [2022-11-21 09:13:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:13:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:13:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:13:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119160359] [2022-11-21 09:13:23,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119160359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:13:23,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:13:23,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:13:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018534136] [2022-11-21 09:13:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:13:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:13:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:13:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:13:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:13:23,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-11-21 09:13:23,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:23,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:13:23,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-11-21 09:13:23,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:13:24,295 INFO L130 PetriNetUnfolder]: 122/390 cut-off events. [2022-11-21 09:13:24,295 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-21 09:13:24,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 390 events. 122/390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1782 event pairs, 10 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 661. Up to 67 conditions per place. [2022-11-21 09:13:24,301 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 21 selfloop transitions, 5 changer transitions 35/127 dead transitions. [2022-11-21 09:13:24,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 402 flow [2022-11-21 09:13:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 09:13:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 09:13:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 843 transitions. [2022-11-21 09:13:24,304 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.860204081632653 [2022-11-21 09:13:24,304 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 843 transitions. [2022-11-21 09:13:24,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 843 transitions. [2022-11-21 09:13:24,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:13:24,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 843 transitions. [2022-11-21 09:13:24,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,311 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,311 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 10 states and 843 transitions. [2022-11-21 09:13:24,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 402 flow [2022-11-21 09:13:24,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 386 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-21 09:13:24,318 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 214 flow [2022-11-21 09:13:24,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2022-11-21 09:13:24,323 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-11-21 09:13:24,323 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 214 flow [2022-11-21 09:13:24,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:24,325 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:24,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:13:24,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 963832841, now seen corresponding path program 1 times [2022-11-21 09:13:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:24,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355282811] [2022-11-21 09:13:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:13:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:13:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:13:24,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355282811] [2022-11-21 09:13:24,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355282811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:13:24,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:13:24,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 09:13:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126287924] [2022-11-21 09:13:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:13:24,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:13:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:13:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:13:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:13:24,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-11-21 09:13:24,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:13:24,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-11-21 09:13:24,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:13:24,928 INFO L130 PetriNetUnfolder]: 27/163 cut-off events. [2022-11-21 09:13:24,929 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-11-21 09:13:24,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 163 events. 27/163 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 403 event pairs, 3 based on Foata normal form. 6/167 useless extension candidates. Maximal degree in co-relation 318. Up to 24 conditions per place. [2022-11-21 09:13:24,930 INFO L137 encePairwiseOnDemand]: 90/98 looper letters, 14 selfloop transitions, 7 changer transitions 17/104 dead transitions. [2022-11-21 09:13:24,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 377 flow [2022-11-21 09:13:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 09:13:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 09:13:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 820 transitions. [2022-11-21 09:13:24,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2022-11-21 09:13:24,934 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 820 transitions. [2022-11-21 09:13:24,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 820 transitions. [2022-11-21 09:13:24,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:13:24,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 820 transitions. [2022-11-21 09:13:24,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,945 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,945 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 214 flow. Second operand 10 states and 820 transitions. [2022-11-21 09:13:24,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 377 flow [2022-11-21 09:13:24,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 338 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-21 09:13:24,952 INFO L231 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow [2022-11-21 09:13:24,953 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2022-11-21 09:13:24,958 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-11-21 09:13:24,959 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow [2022-11-21 09:13:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:24,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:24,959 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:24,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 09:13:24,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1892157195, now seen corresponding path program 1 times [2022-11-21 09:13:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:24,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593153720] [2022-11-21 09:13:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:24,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:13:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:13:26,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:13:26,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593153720] [2022-11-21 09:13:26,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593153720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:13:26,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:13:26,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 09:13:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141788542] [2022-11-21 09:13:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:13:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 09:13:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:13:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 09:13:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:13:26,123 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-11-21 09:13:26,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 9 states, 9 states have (on average 76.11111111111111) internal successors, (685), 9 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:13:26,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-11-21 09:13:26,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:13:26,395 INFO L130 PetriNetUnfolder]: 4/120 cut-off events. [2022-11-21 09:13:26,395 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-11-21 09:13:26,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 120 events. 4/120 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 1 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 177. Up to 16 conditions per place. [2022-11-21 09:13:26,396 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 16 selfloop transitions, 4 changer transitions 6/90 dead transitions. [2022-11-21 09:13:26,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 90 transitions, 292 flow [2022-11-21 09:13:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 09:13:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 09:13:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 767 transitions. [2022-11-21 09:13:26,405 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7826530612244897 [2022-11-21 09:13:26,405 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 767 transitions. [2022-11-21 09:13:26,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 767 transitions. [2022-11-21 09:13:26,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:13:26,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 767 transitions. [2022-11-21 09:13:26,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.7) internal successors, (767), 10 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,414 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,415 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 10 states and 767 transitions. [2022-11-21 09:13:26,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 90 transitions, 292 flow [2022-11-21 09:13:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 90 transitions, 246 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-11-21 09:13:26,422 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 200 flow [2022-11-21 09:13:26,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2022-11-21 09:13:26,424 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-11-21 09:13:26,425 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 200 flow [2022-11-21 09:13:26,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 76.11111111111111) internal successors, (685), 9 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,425 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:26,426 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:26,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 09:13:26,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1349272507, now seen corresponding path program 2 times [2022-11-21 09:13:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:26,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870224127] [2022-11-21 09:13:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:13:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:13:26,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:13:26,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870224127] [2022-11-21 09:13:26,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870224127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:13:26,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:13:26,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 09:13:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401417746] [2022-11-21 09:13:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:13:26,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:13:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:13:26,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:13:26,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:13:26,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-21 09:13:26,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:13:26,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-21 09:13:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:13:26,934 INFO L130 PetriNetUnfolder]: 8/138 cut-off events. [2022-11-21 09:13:26,935 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-11-21 09:13:26,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 138 events. 8/138 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 242 event pairs, 0 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 219. Up to 21 conditions per place. [2022-11-21 09:13:26,935 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 15 selfloop transitions, 1 changer transitions 11/94 dead transitions. [2022-11-21 09:13:26,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 297 flow [2022-11-21 09:13:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:13:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 09:13:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2022-11-21 09:13:26,938 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.826530612244898 [2022-11-21 09:13:26,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 567 transitions. [2022-11-21 09:13:26,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 567 transitions. [2022-11-21 09:13:26,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:13:26,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 567 transitions. [2022-11-21 09:13:26,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,943 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 200 flow. Second operand 7 states and 567 transitions. [2022-11-21 09:13:26,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 297 flow [2022-11-21 09:13:26,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 267 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-21 09:13:26,946 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 197 flow [2022-11-21 09:13:26,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2022-11-21 09:13:26,947 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2022-11-21 09:13:26,947 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 197 flow [2022-11-21 09:13:26,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:26,947 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:13:26,947 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:13:26,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 09:13:26,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-21 09:13:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:13:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1042195599, now seen corresponding path program 3 times [2022-11-21 09:13:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:13:26,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278267467] [2022-11-21 09:13:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:13:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:13:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:13:26,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 09:13:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:13:27,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 09:13:27,046 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 09:13:27,047 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-21 09:13:27,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-21 09:13:27,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-21 09:13:27,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-21 09:13:27,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-21 09:13:27,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 09:13:27,050 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-21 09:13:27,056 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 09:13:27,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 09:13:27,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:13:27 BasicIcfg [2022-11-21 09:13:27,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 09:13:27,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 09:13:27,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 09:13:27,161 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 09:13:27,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:13:21" (3/4) ... [2022-11-21 09:13:27,163 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 09:13:27,247 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 09:13:27,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 09:13:27,248 INFO L158 Benchmark]: Toolchain (without parser) took 7430.48ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 134.6MB in the beginning and 75.0MB in the end (delta: 59.6MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,248 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:13:27,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.59ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 125.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.37ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,249 INFO L158 Benchmark]: Boogie Preprocessor took 63.71ms. Allocated memory is still 169.9MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,249 INFO L158 Benchmark]: RCFGBuilder took 813.08ms. Allocated memory is still 169.9MB. Free memory was 121.2MB in the beginning and 91.9MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,250 INFO L158 Benchmark]: TraceAbstraction took 5606.52ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 90.8MB in the beginning and 91.8MB in the end (delta: -957.4kB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,250 INFO L158 Benchmark]: Witness Printer took 86.53ms. Allocated memory is still 247.5MB. Free memory was 91.8MB in the beginning and 75.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 09:13:27,277 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.59ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 125.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.37ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.71ms. Allocated memory is still 169.9MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 813.08ms. Allocated memory is still 169.9MB. Free memory was 121.2MB in the beginning and 91.9MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5606.52ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 90.8MB in the beginning and 91.8MB in the end (delta: -957.4kB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. * Witness Printer took 86.53ms. Allocated memory is still 247.5MB. Free memory was 91.8MB in the beginning and 75.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y=0, z=0] [L813] 0 pthread_t t903; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__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, pthread_create(&t903, ((void *)0), P0, ((void *)0))=-1, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L815] 0 pthread_t t904; VAL [__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, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__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, pthread_create(&t904, ((void *)0), P1, ((void *)0))=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y=0, z=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y=1, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y=1, z=0] [L743] 1 z = 1 VAL [__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=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, 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 [__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=49, weak$$choice2=0, x=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, 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__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=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 421 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 42 mSDtfsCounter, 421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 09:13:27,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8b777bb-a908-4fd6-8491-659cc06401f6/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE