./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS --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 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- 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-4e7fbc6 [2022-11-23 02:29:44,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:29:44,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:29:44,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:29:44,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:29:44,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:29:44,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:29:44,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:29:44,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:29:44,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:29:44,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:29:44,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:29:44,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:29:44,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:29:44,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:29:44,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:29:44,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:29:44,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:29:44,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:29:44,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:29:44,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:29:44,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:29:44,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:29:44,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:29:44,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:29:44,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:29:44,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:29:44,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:29:44,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:29:44,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:29:44,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:29:44,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:29:44,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:29:44,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:29:44,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:29:44,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:29:44,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:29:44,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:29:44,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:29:44,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:29:44,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:29:44,572 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:29:44,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:29:44,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:29:44,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:29:44,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:29:44,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:29:44,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:29:44,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:29:44,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:29:44,616 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:29:44,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:29:44,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:29:44,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:29:44,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:29:44,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:29:44,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:29:44,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:29:44,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:29:44,619 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:29:44,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:29:44,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:29:44,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:29:44,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:29:44,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:29:44,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:29:44,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:29:44,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:29:44,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:29:44,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:29:44,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:29:44,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:29:44,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:29:44,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:29:44,624 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:29:44,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:29:44,625 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/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_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS 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 -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2022-11-23 02:29:44,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:29:44,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:29:44,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:29:44,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:29:44,934 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:29:44,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/rfi010.i [2022-11-23 02:29:47,954 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:29:48,223 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:29:48,224 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/sv-benchmarks/c/pthread-wmm/rfi010.i [2022-11-23 02:29:48,256 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/data/6504ee00e/0f296ae364634e02b6dfb7a5e1edb66c/FLAG467358e46 [2022-11-23 02:29:48,270 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/data/6504ee00e/0f296ae364634e02b6dfb7a5e1edb66c [2022-11-23 02:29:48,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:29:48,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:29:48,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:29:48,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:29:48,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:29:48,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:29:48" (1/1) ... [2022-11-23 02:29:48,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63707218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:48, skipping insertion in model container [2022-11-23 02:29:48,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:29:48" (1/1) ... [2022-11-23 02:29:48,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:29:48,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:29:48,574 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_16ea6924-bd89-4067-afd4-8a470fe6efde/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2022-11-23 02:29:48,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:29:48,919 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:29:48,934 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_16ea6924-bd89-4067-afd4-8a470fe6efde/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2022-11-23 02:29:48,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:29:49,020 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:29:49,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49 WrapperNode [2022-11-23 02:29:49,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:29:49,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:29:49,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:29:49,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:29:49,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,071 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-23 02:29:49,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:29:49,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:29:49,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:29:49,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:29:49,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:29:49,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:29:49,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:29:49,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:29:49,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (1/1) ... [2022-11-23 02:29:49,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:29:49,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:29:49,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:29:49,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:29:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:29:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:29:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:29:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:29:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:29:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:29:49,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:29:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:29:49,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:29:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:29:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:29:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:29:49,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:29:49,223 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:29:49,392 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:29:49,394 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:29:49,727 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:29:49,984 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:29:49,984 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:29:49,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:49 BoogieIcfgContainer [2022-11-23 02:29:49,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:29:49,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:29:49,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:29:49,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:29:49,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:29:48" (1/3) ... [2022-11-23 02:29:49,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7409ac64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:29:49, skipping insertion in model container [2022-11-23 02:29:49,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:49" (2/3) ... [2022-11-23 02:29:49,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7409ac64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:29:49, skipping insertion in model container [2022-11-23 02:29:49,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:49" (3/3) ... [2022-11-23 02:29:49,996 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2022-11-23 02:29:50,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:29:50,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:29:50,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:29:50,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:29:50,078 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:29:50,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-11-23 02:29:50,166 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-11-23 02:29:50,166 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:29:50,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-23 02:29:50,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-11-23 02:29:50,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-11-23 02:29:50,189 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:29:50,224 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2022-11-23 02:29:50,228 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2022-11-23 02:29:50,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2022-11-23 02:29:50,255 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-11-23 02:29:50,255 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:29:50,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-23 02:29:50,257 INFO L119 LiptonReduction]: Number of co-enabled transitions 1122 [2022-11-23 02:29:54,836 INFO L134 LiptonReduction]: Checked pairs total: 2874 [2022-11-23 02:29:54,836 INFO L136 LiptonReduction]: Total number of compositions: 89 [2022-11-23 02:29:54,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:29:54,860 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;@2617dac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:29:54,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-23 02:29:54,864 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-23 02:29:54,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:29:54,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:54,866 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:29:54,866 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-23 02:29:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 429570035, now seen corresponding path program 1 times [2022-11-23 02:29:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:54,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857702890] [2022-11-23 02:29:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:55,386 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-23 02:29:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857702890] [2022-11-23 02:29:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857702890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:55,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:55,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:29:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694759153] [2022-11-23 02:29:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:55,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:29:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:29:55,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:29:55,439 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 185 [2022-11-23 02:29:55,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-23 02:29:55,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:55,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 185 [2022-11-23 02:29:55,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:29:55,657 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-11-23 02:29:55,657 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-23 02:29:55,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 326 events. 173/326 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1266 event pairs, 21 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 632. Up to 249 conditions per place. [2022-11-23 02:29:55,664 INFO L137 encePairwiseOnDemand]: 181/185 looper letters, 20 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2022-11-23 02:29:55,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 104 flow [2022-11-23 02:29:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:29:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:29:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2022-11-23 02:29:55,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2022-11-23 02:29:55,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2022-11-23 02:29:55,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2022-11-23 02:29:55,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:29:55,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2022-11-23 02:29:55,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-23 02:29:55,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-23 02:29:55,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-23 02:29:55,718 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 279 transitions. [2022-11-23 02:29:55,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 104 flow [2022-11-23 02:29:55,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:29:55,723 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2022-11-23 02:29:55,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-11-23 02:29:55,729 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2022-11-23 02:29:55,730 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2022-11-23 02:29:55,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-23 02:29:55,730 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:55,730 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:29:55,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:29:55,731 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-23 02:29:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1680396149, now seen corresponding path program 1 times [2022-11-23 02:29:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409837255] [2022-11-23 02:29:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:56,074 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-23 02:29:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:56,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409837255] [2022-11-23 02:29:56,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409837255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:56,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:56,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:29:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501924808] [2022-11-23 02:29:56,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:56,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:29:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:56,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:29:56,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:29:56,108 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 185 [2022-11-23 02:29:56,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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-23 02:29:56,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:56,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 185 [2022-11-23 02:29:56,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:29:56,299 INFO L130 PetriNetUnfolder]: 175/320 cut-off events. [2022-11-23 02:29:56,300 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-23 02:29:56,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 320 events. 175/320 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1143 event pairs, 67 based on Foata normal form. 24/344 useless extension candidates. Maximal degree in co-relation 664. Up to 251 conditions per place. [2022-11-23 02:29:56,303 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 21 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2022-11-23 02:29:56,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 37 transitions, 164 flow [2022-11-23 02:29:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:29:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:29:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-11-23 02:29:56,305 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46918918918918917 [2022-11-23 02:29:56,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 434 transitions. [2022-11-23 02:29:56,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 434 transitions. [2022-11-23 02:29:56,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:29:56,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 434 transitions. [2022-11-23 02:29:56,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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-23 02:29:56,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:56,311 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:56,311 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 5 states and 434 transitions. [2022-11-23 02:29:56,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 37 transitions, 164 flow [2022-11-23 02:29:56,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:29:56,313 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 63 flow [2022-11-23 02:29:56,314 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2022-11-23 02:29:56,314 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-11-23 02:29:56,315 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 63 flow [2022-11-23 02:29:56,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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-23 02:29:56,315 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:56,315 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:29:56,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:29:56,316 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-23 02:29:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1756613136, now seen corresponding path program 1 times [2022-11-23 02:29:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:56,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060446855] [2022-11-23 02:29:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:56,569 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-23 02:29:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:56,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060446855] [2022-11-23 02:29:56,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060446855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:56,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:56,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:29:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810838450] [2022-11-23 02:29:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:56,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:29:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:56,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:29:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:29:56,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 185 [2022-11-23 02:29:56,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-23 02:29:56,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:56,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 185 [2022-11-23 02:29:56,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:29:56,762 INFO L130 PetriNetUnfolder]: 153/278 cut-off events. [2022-11-23 02:29:56,762 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-11-23 02:29:56,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 278 events. 153/278 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 904 event pairs, 53 based on Foata normal form. 12/290 useless extension candidates. Maximal degree in co-relation 696. Up to 197 conditions per place. [2022-11-23 02:29:56,764 INFO L137 encePairwiseOnDemand]: 181/185 looper letters, 19 selfloop transitions, 3 changer transitions 8/30 dead transitions. [2022-11-23 02:29:56,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 153 flow [2022-11-23 02:29:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:29:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:29:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2022-11-23 02:29:56,767 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46054054054054056 [2022-11-23 02:29:56,767 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 426 transitions. [2022-11-23 02:29:56,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 426 transitions. [2022-11-23 02:29:56,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:29:56,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 426 transitions. [2022-11-23 02:29:56,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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-23 02:29:56,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:56,772 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:56,772 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 63 flow. Second operand 5 states and 426 transitions. [2022-11-23 02:29:56,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 153 flow [2022-11-23 02:29:56,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 144 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 02:29:56,774 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 71 flow [2022-11-23 02:29:56,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-11-23 02:29:56,775 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2022-11-23 02:29:56,775 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 71 flow [2022-11-23 02:29:56,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-23 02:29:56,776 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:56,776 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:29:56,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:29:56,777 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-23 02:29:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 17503612, now seen corresponding path program 1 times [2022-11-23 02:29:56,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:56,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178665048] [2022-11-23 02:29:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:57,009 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-23 02:29:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178665048] [2022-11-23 02:29:57,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178665048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:57,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:57,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:29:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756945619] [2022-11-23 02:29:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:57,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:29:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:29:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:29:57,028 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2022-11-23 02:29:57,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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-23 02:29:57,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:57,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2022-11-23 02:29:57,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:29:57,156 INFO L130 PetriNetUnfolder]: 65/145 cut-off events. [2022-11-23 02:29:57,156 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-11-23 02:29:57,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 145 events. 65/145 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 466 event pairs, 12 based on Foata normal form. 20/165 useless extension candidates. Maximal degree in co-relation 377. Up to 71 conditions per place. [2022-11-23 02:29:57,162 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 23 selfloop transitions, 3 changer transitions 17/44 dead transitions. [2022-11-23 02:29:57,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 245 flow [2022-11-23 02:29:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:29:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:29:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-11-23 02:29:57,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4821621621621622 [2022-11-23 02:29:57,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2022-11-23 02:29:57,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2022-11-23 02:29:57,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:29:57,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2022-11-23 02:29:57,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-23 02:29:57,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:57,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:57,171 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 71 flow. Second operand 5 states and 446 transitions. [2022-11-23 02:29:57,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 245 flow [2022-11-23 02:29:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 227 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 02:29:57,174 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 88 flow [2022-11-23 02:29:57,174 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-11-23 02:29:57,176 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2022-11-23 02:29:57,176 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 88 flow [2022-11-23 02:29:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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-23 02:29:57,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:57,177 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:29:57,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:29:57,177 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-23 02:29:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2133462383, now seen corresponding path program 1 times [2022-11-23 02:29:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438697046] [2022-11-23 02:29:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:57,509 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-23 02:29:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:57,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438697046] [2022-11-23 02:29:57,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438697046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:57,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:57,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:29:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057458738] [2022-11-23 02:29:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:57,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:29:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:57,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:29:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:29:57,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2022-11-23 02:29:57,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 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-23 02:29:57,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:57,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2022-11-23 02:29:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:29:57,671 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2022-11-23 02:29:57,671 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-23 02:29:57,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 68 events. 24/68 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 150 event pairs, 8 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 198. Up to 29 conditions per place. [2022-11-23 02:29:57,672 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 21 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2022-11-23 02:29:57,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 212 flow [2022-11-23 02:29:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:29:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:29:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2022-11-23 02:29:57,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2022-11-23 02:29:57,675 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 520 transitions. [2022-11-23 02:29:57,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 520 transitions. [2022-11-23 02:29:57,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:29:57,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 520 transitions. [2022-11-23 02:29:57,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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-23 02:29:57,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 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-23 02:29:57,680 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 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-23 02:29:57,680 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 88 flow. Second operand 6 states and 520 transitions. [2022-11-23 02:29:57,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 212 flow [2022-11-23 02:29:57,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 182 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-23 02:29:57,683 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 88 flow [2022-11-23 02:29:57,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2022-11-23 02:29:57,684 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2022-11-23 02:29:57,684 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 88 flow [2022-11-23 02:29:57,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 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-23 02:29:57,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:57,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:29:57,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:29:57,685 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-23 02:29:57,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2032986766, now seen corresponding path program 1 times [2022-11-23 02:29:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:57,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223696634] [2022-11-23 02:29:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:57,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:57,914 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-23 02:29:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:57,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223696634] [2022-11-23 02:29:57,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223696634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:57,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:57,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:29:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153283041] [2022-11-23 02:29:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:57,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:29:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:29:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:29:57,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 185 [2022-11-23 02:29:57,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 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-23 02:29:57,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:57,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 185 [2022-11-23 02:29:57,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:29:58,061 INFO L130 PetriNetUnfolder]: 24/73 cut-off events. [2022-11-23 02:29:58,062 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-11-23 02:29:58,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 73 events. 24/73 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 1 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 215. Up to 46 conditions per place. [2022-11-23 02:29:58,063 INFO L137 encePairwiseOnDemand]: 181/185 looper letters, 19 selfloop transitions, 1 changer transitions 16/36 dead transitions. [2022-11-23 02:29:58,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 233 flow [2022-11-23 02:29:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:29:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:29:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2022-11-23 02:29:58,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46054054054054056 [2022-11-23 02:29:58,065 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 426 transitions. [2022-11-23 02:29:58,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 426 transitions. [2022-11-23 02:29:58,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:29:58,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 426 transitions. [2022-11-23 02:29:58,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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-23 02:29:58,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:58,070 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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-23 02:29:58,070 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 88 flow. Second operand 5 states and 426 transitions. [2022-11-23 02:29:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 233 flow [2022-11-23 02:29:58,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 202 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-23 02:29:58,072 INFO L231 Difference]: Finished difference. Result has 34 places, 18 transitions, 73 flow [2022-11-23 02:29:58,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2022-11-23 02:29:58,073 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2022-11-23 02:29:58,073 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 73 flow [2022-11-23 02:29:58,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 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-23 02:29:58,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:29:58,074 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:29:58,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:29:58,075 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-23 02:29:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:29:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -502470000, now seen corresponding path program 2 times [2022-11-23 02:29:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:29:58,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487413683] [2022-11-23 02:29:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:29:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:29:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:29:59,846 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-23 02:29:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:29:59,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487413683] [2022-11-23 02:29:59,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487413683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:29:59,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:29:59,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:29:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700015311] [2022-11-23 02:29:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:29:59,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:29:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:29:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:29:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:29:59,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 185 [2022-11-23 02:29:59,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 73 flow. Second operand has 8 states, 8 states have (on average 75.875) internal successors, (607), 8 states have internal predecessors, (607), 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-23 02:29:59,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:29:59,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 185 [2022-11-23 02:29:59,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:30:00,391 INFO L130 PetriNetUnfolder]: 10/46 cut-off events. [2022-11-23 02:30:00,391 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-23 02:30:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 46 events. 10/46 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 2 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 138. Up to 13 conditions per place. [2022-11-23 02:30:00,392 INFO L137 encePairwiseOnDemand]: 177/185 looper letters, 13 selfloop transitions, 5 changer transitions 11/30 dead transitions. [2022-11-23 02:30:00,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 188 flow [2022-11-23 02:30:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:30:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:30:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2022-11-23 02:30:00,396 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4156156156156156 [2022-11-23 02:30:00,396 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 692 transitions. [2022-11-23 02:30:00,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 692 transitions. [2022-11-23 02:30:00,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:30:00,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 692 transitions. [2022-11-23 02:30:00,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.88888888888889) internal successors, (692), 9 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:30:00,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 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-23 02:30:00,402 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 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-23 02:30:00,406 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 73 flow. Second operand 9 states and 692 transitions. [2022-11-23 02:30:00,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 188 flow [2022-11-23 02:30:00,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 176 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-23 02:30:00,408 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 84 flow [2022-11-23 02:30:00,408 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2022-11-23 02:30:00,409 INFO L288 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-11-23 02:30:00,409 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 84 flow [2022-11-23 02:30:00,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.875) internal successors, (607), 8 states have internal predecessors, (607), 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-23 02:30:00,410 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:30:00,410 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:30:00,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:30:00,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 02:30:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:30:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 964772332, now seen corresponding path program 3 times [2022-11-23 02:30:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:30:00,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526632448] [2022-11-23 02:30:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:30:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:30:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:30:00,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:30:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:30:00,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:30:00,532 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:30:00,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-23 02:30:00,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-23 02:30:00,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-23 02:30:00,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-23 02:30:00,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-23 02:30:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:30:00,536 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-23 02:30:00,543 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:30:00,543 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:30:00,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:30:00 BasicIcfg [2022-11-23 02:30:00,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:30:00,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:30:00,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:30:00,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:30:00,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:49" (3/4) ... [2022-11-23 02:30:00,593 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:30:00,721 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:30:00,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:30:00,722 INFO L158 Benchmark]: Toolchain (without parser) took 12447.86ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 146.9MB in the beginning and 199.5MB in the end (delta: -52.6MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,722 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 140.5MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:30:00,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.84ms. Allocated memory is still 195.0MB. Free memory was 146.9MB in the beginning and 123.5MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.54ms. Allocated memory is still 195.0MB. Free memory was 123.5MB in the beginning and 120.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,723 INFO L158 Benchmark]: Boogie Preprocessor took 47.25ms. Allocated memory is still 195.0MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,723 INFO L158 Benchmark]: RCFGBuilder took 867.17ms. Allocated memory is still 195.0MB. Free memory was 118.8MB in the beginning and 159.2MB in the end (delta: -40.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,724 INFO L158 Benchmark]: TraceAbstraction took 10601.68ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 158.2MB in the beginning and 71.1MB in the end (delta: 87.1MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,724 INFO L158 Benchmark]: Witness Printer took 130.90ms. Allocated memory is still 234.9MB. Free memory was 71.1MB in the beginning and 199.5MB in the end (delta: -128.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-23 02:30:00,726 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.27ms. Allocated memory is still 140.5MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.84ms. Allocated memory is still 195.0MB. Free memory was 146.9MB in the beginning and 123.5MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.54ms. Allocated memory is still 195.0MB. Free memory was 123.5MB in the beginning and 120.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.25ms. Allocated memory is still 195.0MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 867.17ms. Allocated memory is still 195.0MB. Free memory was 118.8MB in the beginning and 159.2MB in the end (delta: -40.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10601.68ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 158.2MB in the beginning and 71.1MB in the end (delta: 87.1MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. * Witness Printer took 130.90ms. Allocated memory is still 234.9MB. Free memory was 71.1MB in the beginning and 199.5MB in the end (delta: -128.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 99 PlacesBefore, 25 PlacesAfterwards, 94 TransitionsBefore, 19 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 2874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1641, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 888, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 472, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 431, dependent conditional: 0, dependent unconditional: 431, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1641, independent: 667, independent conditional: 0, independent unconditional: 667, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 888, unknown conditional: 0, unknown unconditional: 888] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1761, ((void *)0), P0, ((void *)0))=0, t1761={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1762, ((void *)0), P1, ((void *)0))=1, t1761={5:0}, t1762={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_p1_EBX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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, 114 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: 10.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 637 IncrementalHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 30 mSDtfsCounter, 637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=4, InterpolantAutomatonStates: 38, 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, 3.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 02:30:00,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ea6924-bd89-4067-afd4-8a470fe6efde/bin/uautomizer-QkZJyEgLgS/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